Peng Zhang

According to our database, Peng Zhang authored at least 53 papers between 2006 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

New algorithms for a simple measure of network partitioning.

Xueyang Zhao, Binghao Yan, Peng Zhang

Theor. Comput. Sci., May, 2023

New approximation algorithms for the rooted Budgeted Cycle Cover problem.

Jiangkun Li, Peng Zhang

Theor. Comput. Sci., 2023

Simple Heuristics for the Rooted Max Tree Coverage Problem.

Jiang Zhou, Peng Zhang

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

The LP-rounding plus greed approach for partial optimization revisited.

Peng Zhang

Frontiers Comput. Sci., 2022

2021

Approximating Max <i>k</i>-Uncut via LP-rounding plus greed, with applications to Densest <i>k</i>-Subgraph.

Peng Zhang, Zhendong Liu

Theor. Comput. Sci., 2021

2020

The seeding algorithm for k-means problem with penalties.

Min Li, Dachuan Xu, Jun Yue, Dongmei Zhang, Peng Zhang

J. Comb. Optim., 2020

A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem.

Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu, Peng Zhang

J. Comb. Optim., 2020

Minimum Label <i>s</i>-<i>t</i> Cut has large integrality gaps.

Peng Zhang, Linqing Tang

Inf. Comput., 2020

Approximating the Weighted Minimum Label s-t Cut Problem.

Peng Zhang

CoRR, 2020

Approximating Max k-Uncut via LP-rounding Plus Greed, with Applications to Densest k-Subgraph.

Peng Zhang, Zhendong Liu

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

Local search approximation algorithms for the sum of squares facility location problems.

Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang, Zhenning Zhang

J. Glob. Optim., 2019

An approximation algorithm for genome sorting by reversals to recover all adjacencies.

Shanshan Zhai, Peng Zhang, Daming Zhu, Weitian Tong, Yao Xu, Guohui Lin

J. Comb. Optim., 2019

Minimum Label s-t Cut has Large Integrality Gaps.

Peng Zhang, Linqing Tang

CoRR, 2019

2018

Approximation and hardness results for the Max <i>k</i>-Uncut problem.

Peng Zhang, Chenchen Wu, Dachuan Xu

Theor. Comput. Sci., 2018

Computing and estimating the volume of the solution space of SMT(LA) constraints.

Cunjing Ge, Feifei Ma, Peng Zhang, Jian Zhang

Theor. Comput. Sci., 2018

Approximation algorithms for the robust/soft-capacitated 2-level facility location problems.

Chenchen Wu, Dachuan Xu, Dongmei Zhang, Peng Zhang

J. Glob. Optim., 2018

A local search approximation algorithm for a squared metric k-facility location problem.

Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang, Zhenning Zhang

J. Comb. Optim., 2018

Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems.

Peng Zhang, Yao Xu, Tao Jiang, Angsheng Li, Guohui Lin, Eiji Miyano

Algorithmica, 2018

Simpler and Better Approximation Algorithms for the Unweighted Minimum Label s-t Cut Problem.

Peng Zhang, Bin Fu, Linqing Tang

Algorithmica, 2018

2017

A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem.

Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Peng Zhang

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

The label cut problem with respect to path length and label frequency.

Peng Zhang, Bin Fu

Theor. Comput. Sci., 2016

A new approximation algorithm for the unbalanced Min s-t Cut problem.

Peng Zhang

Theor. Comput. Sci., 2016

Approximation and Hardness Results for the Max k-Uncut Problem.

Peng Zhang, Chenchen Wu, Dachuan Xu, Xinghe Zhang

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Algorithmic aspects of homophyly of networks.

Peng Zhang, Angsheng Li

Theor. Comput. Sci., 2015

Improved parameterized and exact algorithms for cut problems on trees.

Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu

Theor. Comput. Sci., 2015

Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems.

Peng Zhang, Tao Jiang, Angsheng Li

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design.

Peng Zhang

J. Comb. Optim., 2014

On the generalized multiway cut in trees problem.

Hong Liu, Peng Zhang

J. Comb. Optim., 2014

Unbalanced graph cuts with minimum capacity.

Peng Zhang

Frontiers Comput. Sci., 2014

Efficient Algorithms for the Label Cut Problems.

Peng Zhang

Proceedings of the Theory and Applications of Models of Computation, 2014

Algorithms for Cut Problems on Trees.

Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu

Proceedings of the Combinatorial Optimization and Applications, 2014

2013

Unbalanced Graph Partitioning.

Angsheng Li, Peng Zhang

Theory Comput. Syst., 2013

Complexity and Approximation Results for the Min-Sum and Min-Max Disjoint Paths Problems.

Peng Zhang, Wenbo Zhao, Daming Zhu

Comput. Informatics, 2013

2012

Scheduling mobile collaborating workforce for multiple urgent events.

Yuqing Sun, Dickson K. W. Chiu, Bin Gong, Xiangxu Meng, Peng Zhang

J. Netw. Comput. Appl., 2012

An approximation algorithm for the Generalized k-Multicut problem.

Peng Zhang, Daming Zhu, Junfeng Luan

Discret. Appl. Math., 2012

Approximating Minimum Label s-t Cut via Linear Programming.

Linqing Tang, Peng Zhang

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

On Editing Graphs into 2-Club Clusters.

Hong Liu, Peng Zhang, Daming Zhu

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

Approximation and hardness results for label cut and related problems.

Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao

J. Comb. Optim., 2011

Rent-or-Buy Network Design Problem and the Sample-Augment Algorithm: A Survey.

Peng Zhang

Int. J. Softw. Informatics, 2011

2010

Trust-based on-demand multipath routing in mobile ad hoc networks.

Xin Li, Zhiping Jia, Peng Zhang, Ruihua Zhang, Haiyang Wang

IET Inf. Secur., 2010

A trust-based multipath routing framework for Mobile Ad hoc NETworks.

Xin Li, Zhiping Jia, Peng Zhang, Haiyang Wang

Proceedings of the Seventh International Conference on Fuzzy Systems and Knowledge Discovery, 2010

Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors.

Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Peng Zhang

Proceedings of the Theory of Computing 2010, 2010

2009

An approximation algorithm to the k-Steiner Forest problem.

Peng Zhang, Mingji Xia

Theor. Comput. Sci., 2009

A Bicriteria Approximation Algorithm for Generalized k-Multicut in Trees.

Peng Zhang, Daming Zhu, Junfeng Luan

Proceedings of the Second International Joint Conference on Computational Sciences and Optimization, 2009

2008

On Constrained Facility Location Problems.

Wei-Lin Li, Peng Zhang, Daming Zhu

J. Comput. Sci. Technol., 2008

2007

A new approximation algorithm for the k-facility location problem.

Peng Zhang

Theor. Comput. Sci., 2007

Computational complexity of counting problems on 3-regular planar graphs.

Mingji Xia, Peng Zhang, Wenbo Zhao

Theor. Comput. Sci., 2007

Approximation to the Minimum Rooted Star Cover Problem.

Wenbo Zhao, Peng Zhang

Proceedings of the Theory and Applications of Models of Computation, 2007

An Approximation Algorithm to the <i>k</i> -Steiner Forest Problem.

Peng Zhang

Proceedings of the Theory and Applications of Models of Computation, 2007

On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems.

Peng Zhang, Wenbo Zhao

Proceedings of the Combinatorics, 2007

Approximating Generalized Multicut on Trees.

Peng Zhang

Proceedings of the Computation and Logic in the Real World, 2007

2006

A network flow approach to the Minimum Common Integer Partition Problem.

Wenbo Zhao, Peng Zhang, Tao Jiang

Theor. Comput. Sci., 2006

A New Approximation Algorithm for the <i>k</i>-Facility Location Problem.

Peng Zhang

Proceedings of the Theory and Applications of Models of Computation, 2006