Peng Zhang

Publication Activity (10 Years)

Years Active: 2006-2023
Publications (10 Years): 25

Top Topics

Facility Location Problem

Integrality Gap

Approximation Algorithms

Top Venues

Theor. Comput. Sci.

J. Comb. Optim.

Publications

Xueyang Zhao, Binghao Yan, Peng Zhang
New algorithms for a simple measure of network partitioning. Theor. Comput. Sci. 957 (2023)
Jiangkun Li, Peng Zhang
New approximation algorithms for the rooted Budgeted Cycle Cover problem. Theor. Comput. Sci. 940 (Part) (2023)
Peng Zhang
The LP-rounding plus greed approach for partial optimization revisited. Frontiers Comput. Sci. 16 (1) (2022)
Xueyang Zhao, Binghao Yan, Peng Zhang
New Algorithms for a Simple Measure of Network Partitioning. TAMC (2022)
Peng Zhang, Zhendong Liu
-Subgraph. Theor. Comput. Sci. 849 (2021)
Jiangkun Li, Peng Zhang
New Approximation Algorithms for the Rooted Budgeted Cycle Cover Problem. COCOA (2021)
Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu, Peng Zhang
A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem. J. Comb. Optim. 40 (3) (2020)
Min Li, Dachuan Xu, Jun Yue, Dongmei Zhang, Peng Zhang
The seeding algorithm for k-means problem with penalties. J. Comb. Optim. 39 (1) (2020)
Peng Zhang, Linqing Tang
Cut has large integrality gaps. Inf. Comput. 275 (2020)
Peng Zhang, Zhendong Liu
Approximating Max k-Uncut via LP-rounding Plus Greed, with Applications to Densest k-Subgraph. AAIM (2020)
Peng Zhang
Approximating the Weighted Minimum Label s-t Cut Problem. CoRR (2020)
Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang, Zhenning Zhang
Local search approximation algorithms for the sum of squares facility location problems. J. Glob. Optim. 74 (4) (2019)
Peng Zhang, Linqing Tang
Minimum Label s-t Cut has Large Integrality Gaps. CoRR (2019)
Shanshan Zhai, Peng Zhang, Daming Zhu, Weitian Tong, Yao Xu, Guohui Lin
An approximation algorithm for genome sorting by reversals to recover all adjacencies. J. Comb. Optim. 37 (4) (2019)
Peng Zhang, Bin Fu, Linqing Tang
Simpler and Better Approximation Algorithms for the Unweighted Minimum Label s-t Cut Problem. Algorithmica 80 (1) (2018)
Chenchen Wu, Dachuan Xu, Dongmei Zhang, Peng Zhang
Approximation algorithms for the robust/soft-capacitated 2-level facility location problems. J. Glob. Optim. 70 (1) (2018)
Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang, Zhenning Zhang
A local search approximation algorithm for a squared metric k-facility location problem. J. Comb. Optim. 35 (4) (2018)
Cunjing Ge, Feifei Ma, Peng Zhang, Jian Zhang
Computing and estimating the volume of the solution space of SMT(LA) constraints. Theor. Comput. Sci. 743 (2018)
Peng Zhang, Yao Xu, Tao Jiang, Angsheng Li, Guohui Lin, Eiji Miyano
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. Algorithmica 80 (5) (2018)
Peng Zhang, Chenchen Wu, Dachuan Xu
-Uncut problem. Theor. Comput. Sci. 749 (2018)
Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Peng Zhang
A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem. ISAAC (2017)
Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang, Zhenning Zhang
A Local Search Approximation Algorithm for a Squared Metric k-Facility Location Problem. COCOA (1) (2017)
Peng Zhang, Chenchen Wu, Dachuan Xu, Xinghe Zhang
Approximation and Hardness Results for the Max k-Uncut Problem. COCOA (2016)
Peng Zhang, Bin Fu
The label cut problem with respect to path length and label frequency. Theor. Comput. Sci. 648 (2016)
Peng Zhang
A new approximation algorithm for the unbalanced Min s-t Cut problem. Theor. Comput. Sci. 609 (2016)
Peng Zhang, Tao Jiang, Angsheng Li
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. COCOON (2015)
Peng Zhang, Angsheng Li
Algorithmic aspects of homophyly of networks. Theor. Comput. Sci. 593 (2015)
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
Improved parameterized and exact algorithms for cut problems on trees. Theor. Comput. Sci. 607 (2015)
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
Algorithms for Cut Problems on Trees. COCOA (2014)
Peng Zhang
Efficient Algorithms for the Label Cut Problems. TAMC (2014)
Peng Zhang
Unbalanced graph cuts with minimum capacity. Frontiers Comput. Sci. 8 (4) (2014)
Peng Zhang
A New Approximation Algorithm for the Unbalanced Min s-t Cut Problem. COCOON (2014)
Peng Zhang
A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design. J. Comb. Optim. 27 (4) (2014)
Hong Liu, Peng Zhang
On the generalized multiway cut in trees problem. J. Comb. Optim. 27 (1) (2014)
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
Algorithms for Cut Problems on Trees CoRR (2013)
Angsheng Li, Peng Zhang
Unbalanced Graph Partitioning. Theory Comput. Syst. 53 (3) (2013)
Peng Zhang, Wenbo Zhao, Daming Zhu
Complexity and Approximation Results for the Min-Sum and Min-Max Disjoint Paths Problems. Comput. Informatics 32 (1) (2013)
Yuqing Sun, Dickson K. W. Chiu, Bin Gong, Xiangxu Meng, Peng Zhang
Scheduling mobile collaborating workforce for multiple urgent events. J. Netw. Comput. Appl. 35 (1) (2012)
Hong Liu, Peng Zhang
On the Generalized Multiway Cut in Trees Problem. COCOA (2012)
Hong Liu, Peng Zhang, Daming Zhu
On Editing Graphs into 2-Club Clusters. FAW-AAIM (2012)
Linqing Tang, Peng Zhang
Approximating Minimum Label s-t Cut via Linear Programming. LATIN (2012)
Angsheng Li, Peng Zhang
Algorithmic Aspects of Homophyly of Networks CoRR (2012)
Peng Zhang, Daming Zhu, Junfeng Luan
An approximation algorithm for the Generalized k-Multicut problem. Discret. Appl. Math. 160 (7-8) (2012)
Peng Zhang
A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design. COCOA (2011)
Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao
Approximation and hardness results for label cut and related problems. J. Comb. Optim. 21 (2) (2011)
Peng Zhang
Rent-or-Buy Network Design Problem and the Sample-Augment Algorithm: A Survey. Int. J. Softw. Informatics 5 (4) (2011)
Angsheng Li, Peng Zhang
Unbalanced Graph Partitioning. ISAAC (1) (2010)
Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Peng Zhang
Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors. CATS (2010)
Xin Li, Zhiping Jia, Peng Zhang, Haiyang Wang
A trust-based multipath routing framework for Mobile Ad hoc NETworks. FSKD (2010)
Xin Li, Zhiping Jia, Peng Zhang, Ruihua Zhang, Haiyang Wang
Trust-based on-demand multipath routing in mobile ad hoc networks. IET Inf. Secur. 4 (4) (2010)
Peng Zhang, Mingji Xia
An approximation algorithm to the k-Steiner Forest problem. Theor. Comput. Sci. 410 (11) (2009)
Peng Zhang, Daming Zhu, Junfeng Luan
A Bicriteria Approximation Algorithm for Generalized k-Multicut in Trees. CSO (2) (2009)
Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao
Approximation and Hardness Results for Label Cut and Related Problems. TAMC (2009)
Wei-Lin Li, Peng Zhang, Daming Zhu
On Constrained Facility Location Problems. J. Comput. Sci. Technol. 23 (5) (2008)
Peng Zhang
A new approximation algorithm for the k-facility location problem. Theor. Comput. Sci. 384 (1) (2007)
Peng Zhang
Approximating Generalized Multicut on Trees. CiE (2007)
Wenbo Zhao, Peng Zhang
Approximation to the Minimum Rooted Star Cover Problem. TAMC (2007)
Mingji Xia, Peng Zhang, Wenbo Zhao
Computational complexity of counting problems on 3-regular planar graphs. Theor. Comput. Sci. 384 (1) (2007)
Peng Zhang, Wenbo Zhao
On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems. ESCAPE (2007)
Peng Zhang
-Steiner Forest Problem. TAMC (2007)
Peng Zhang
-Facility Location Problem. TAMC (2006)
Wenbo Zhao, Peng Zhang, Tao Jiang
A network flow approach to the Minimum Common Integer Partition Problem. Theor. Comput. Sci. 369 (1-3) (2006)