山东大学教师主页 Peng Zhang Paper Publications Home

Peng Zhang Professor

张鹏（教授，博导）山东大学软件学院 --> 人工智能研究中心 --> 组合优化与算法实验室（COPTA Lab） Peng ZHANG (Professor) Laboratory of Combinatorial Optimization and Algorithms (COPTA Lab), Shandong University. For my English homepage, please visit https://www.researchgate.net/profile/Peng-Zhang-155 . 欢迎来到我的主页。我于2007年7月在中科院软件所取得博士学位，现在山东大学软件学院工作，主要从事算法和计算理论方面的教学和科研工作。 *** 研究领域 *** ... More+

Paper Publications

Home >> Scientific Research >> Paper Publications

TOTAL 77 PIECE 1/4

FIRSTPREVIOUSNEXT LAST PAGE

中文 | MOBILE Version | Login | SDU

Copyright All Rights Reserved Shandong University Address: No. 27 Shanda South Road, Jinan City, Shandong Province, China: 250100
Information desk: (86) - 0531-88395114
On Duty Telephone: (86) - 0531-88364731 Construction and Maintenance: Information Work Office of Shandong University

Click: Times

The Open Time: --

The Last Update Time: --

Home

Scientific Research

Teaching Research

Awards and Honours

Enrollment Information

Student Information

My Album

Blog

More

Paper Publications

[1] . Combining Capacity and Length: Finding Connectivity Bottleneck in a Layered Network. IEEE/ACM Transactions on Networking, 32, 2024.

[2] 周江. An Evolutionary Algorithm Based on CMSA for Rooted Max Tree Coverage. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2024.

[3] 赵雪旸. New algorithms for a simple measure of network partitioning. Theoretical Computer Science, 957, 2023.

[4] 李江坤. New approximation algorithms for the rooted Budgeted Cycle Cover problem. Theoretical Computer Science, 940, 283, 2023.

[5] 张鹏. The label cut problem with respect to path length and label frequency. Theoretical Computer Science, 648, 72-83, 2016.

[6] 张鹏. Algorithmic aspects of homophyly of networks. Theoretical Computer Science, 593, 117-131, 2015.

[7] 郝凡昌. 通过交互式移位-插入-删除进行基因组排序的较快算法. 《计算机研究与发展》, 47, 2011-2023, 2010.

[8] 张鹏. Unbalanced graph cuts with minimum capacity. Frontiers of Computer Science, 8, 676-683, 2014.

[9] . A (1.4+epsilon)-approximation algorithm for the 2-MAX-DUO problem. JournalofCombinatorialOptimization, 40, 806, 2020.

[10] 李江坤. New approximation algorithms for the rooted Budgeted Cycle Cover problem. Theoretical Computer Science, 2023.

[11] 赵雪旸. New algorithms for a simple measure of network partitioning. Theoretical Computer Science, 2023.

[12] 张鹏. An approximation algorithm for the Generalized k-Multicut problem. Discrete Applied Mathematics, 160, 1240-1247, 2012.

[13] 张鹏. The LP-rounding plus greed approach for partial optimization revisited. Frontiers of Computer Science, 16, 2022.

[14] 栾峻峰. 通过交互式移位,插入,删除进行基因组排序的较快算法. 《计算机研究与发展》, 47, 2011, 2010.

[15] 张鹏. The LP-rounding plus greed approach for partial optimization revisited. Frontiers of Computer Science, 16, 2022.

[16] Li, Min. The seeding algorithm for k-means problem with penalties. JournalofCombinatorialOptimization, 39, 15, 2020.

[17] 张鹏. Minimum Label s-t Cut has large integrality gaps（CCF-A）. INFORMATION AND COMPUTATION, 275, 2020.

[18] 张鹏. Approximating max k-uncut via LP-rounding plus greed, with applications to densest k-subgraph. The 14th International Conference of Algorithmic Aspects in Information and Management, 2020.

[19] 张鹏. Unbalanced Graph Partitioning. Theory of Computing Systems, 53, 454, 2013.

[20] Chen, Yong. A (1.4+epsilon)-approximation algorithm for the 2-MAX-DUO problem. JournalofCombinatorialOptimization, 40, 806, 2020.