A New Approximation Algorithm for the k-Facility Location Problem. - Peng Zhang 008 (TAMC, 2006)

A network flow approach to the Minimum Common Integer Partition Problem. - Wenbo Zhao 001; Peng Zhang 008; Tao Jiang 001 (Theor. Comput. Sci., 2006)

Approximating Generalized Multicut on Trees. - Peng Zhang 008 (CiE, 2007)

On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems. - Peng Zhang 008; Wenbo Zhao 001 (ESCAPE, 2007)

An Approximation Algorithm to the k -Steiner Forest Problem. - Peng Zhang 008 (TAMC, 2007)

Approximation to the Minimum Rooted Star Cover Problem. - Wenbo Zhao 001; Peng Zhang 008 (TAMC, 2007)

Computational complexity of counting problems on 3-regular planar graphs. - Mingji Xia; Peng Zhang 008; Wenbo Zhao 001 (Theor. Comput. Sci., 2007)

A new approximation algorithm for the k-facility location problem. - Peng Zhang 008 (Theor. Comput. Sci., 2007)

On Constrained Facility Location Problems. - Wei-Lin Li; Peng Zhang 008; Daming Zhu (J. Comput. Sci. Technol., 2008)

A Bicriteria Approximation Algorithm for Generalized k-Multicut in Trees. - Peng Zhang 008; Daming Zhu; Junfeng Luan (CSO (2), 2009)

An approximation algorithm to the k-Steiner Forest problem. - Peng Zhang 008; Mingji Xia (Theor. Comput. Sci., 2009)

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 008 (CATS, 2010)

A trust-based multipath routing framework for Mobile Ad hoc NETworks. - Xin Li 002; Zhiping Jia; Peng Zhang 008; Haiyang Wang (FSKD, 2010)

Trust-based on-demand multipath routing in mobile ad hoc networks. - Xin Li 002; Zhiping Jia; Peng Zhang 008; Ruihua Zhang; Haiyang Wang (IET Inf. Secur., 2010)

Rent-or-Buy Network Design Problem and the Sample-Augment Algorithm: A Survey. - Peng Zhang 008 (Int. J. Softw. Informatics, 2011)

Approximation and hardness results for label cut and related problems. - Peng Zhang 008; Jin-yi Cai; Linqing Tang; Wenbo Zhao 001 (J. Comb. Optim., 2011)

On Editing Graphs into 2-Club Clusters. - Hong Liu 001; Peng Zhang 008; Daming Zhu (FAW-AAIM, 2012)

Approximating Minimum Label s-t Cut via Linear Programming. - Linqing Tang; Peng Zhang 008 (LATIN, 2012)

An approximation algorithm for the Generalized k-Multicut problem. - Peng Zhang 008; Daming Zhu; Junfeng Luan (Discret. Appl. Math., 2012)

Scheduling mobile collaborating workforce for multiple urgent events. - Yuqing Sun 001; Dickson K. W. Chiu; Bin Gong; Xiangxu Meng; Peng Zhang 008 (J. Netw. Comput. Appl., 2012)

Complexity and Approximation Results for the Min-Sum and Min-Max Disjoint Paths Problems. - Peng Zhang 008; Wenbo Zhao 001; Daming Zhu (Comput. Informatics, 2013)

Unbalanced Graph Partitioning. - Angsheng Li; Peng Zhang 008 (Theory Comput. Syst., 2013)

Algorithms for Cut Problems on Trees. - Iyad A. Kanj; Guohui Lin; Tian Liu 001; Weitian Tong; Ge Xia; Jinhui Xu 001; Boting Yang; Fenghui Zhang; Peng Zhang 008; Binhai Zhu (COCOA, 2014)

Efficient Algorithms for the Label Cut Problems. - Peng Zhang 008 (TAMC, 2014)

Unbalanced graph cuts with minimum capacity. - Peng Zhang 008 (Frontiers Comput. Sci., 2014)

On the generalized multiway cut in trees problem. - Hong Liu 001; Peng Zhang 008 (J. Comb. Optim., 2014)

A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design. - Peng Zhang 008 (J. Comb. Optim., 2014)

Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. - Peng Zhang 008; Tao Jiang 001; Angsheng Li (COCOON, 2015)

Improved parameterized and exact algorithms for cut problems on trees. - Iyad A. Kanj; Guohui Lin; Tian Liu 001; Weitian Tong; Ge Xia; Jinhui Xu 001; Boting Yang; Fenghui Zhang; Peng Zhang 008; Binhai Zhu (Theor. Comput. Sci., 2015)

Algorithmic aspects of homophyly of networks. - Peng Zhang 008; Angsheng Li (Theor. Comput. Sci., 2015)

Approximation and Hardness Results for the Max k-Uncut Problem. - Peng Zhang 008; Chenchen Wu; Dachuan Xu; Xinghe Zhang (COCOA, 2016)

A new approximation algorithm for the unbalanced Min s-t Cut problem. - Peng Zhang 008 (Theor. Comput. Sci., 2016)

The label cut problem with respect to path length and label frequency. - Peng Zhang 008; Bin Fu (Theor. Comput. Sci., 2016)

A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem. - Yao Xu; Yong Chen 002; Guohui Lin; Tian Liu 001; Taibo Luo; Peng Zhang 008 (ISAAC, 2017)

Simpler and Better Approximation Algorithms for the Unweighted Minimum Label s-t Cut Problem. - Peng Zhang 008; Bin Fu; Linqing Tang (Algorithmica, 2018)

Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. - Peng Zhang 008; Yao Xu; Tao Jiang 001; Angsheng Li; Guohui Lin; Eiji Miyano (Algorithmica, 2018)

A local search approximation algorithm for a squared metric k-facility location problem. - Dongmei Zhang 002; Dachuan Xu; Yishui Wang; Peng Zhang 008; Zhenning Zhang (J. Comb. Optim., 2018)

Approximation algorithms for the robust/soft-capacitated 2-level facility location problems. - Chenchen Wu; Dachuan Xu; Dongmei Zhang 002; Peng Zhang 008 (J. Glob. Optim., 2018)

Computing and estimating the volume of the solution space of SMT(LA) constraints. - Cunjing Ge; Feifei Ma; Peng Zhang 008; Jian Zhang 001 (Theor. Comput. Sci., 2018)

Approximation and hardness results for the Max k-Uncut problem. - Peng Zhang 008; Chenchen Wu; Dachuan Xu (Theor. Comput. Sci., 2018)

Minimum Label s-t Cut has Large Integrality Gaps. - Peng Zhang 008; Linqing Tang (CoRR, 2019)

An approximation algorithm for genome sorting by reversals to recover all adjacencies. - Shanshan Zhai; Peng Zhang 008; Daming Zhu; Weitian Tong; Yao Xu; Guohui Lin (J. Comb. Optim., 2019)

Local search approximation algorithms for the sum of squares facility location problems. - Dongmei Zhang 002; Dachuan Xu; Yishui Wang; Peng Zhang 008; Zhenning Zhang (J. Glob. Optim., 2019)

Approximating Max k-Uncut via LP-rounding Plus Greed, with Applications to Densest k-Subgraph. - Peng Zhang 008; Zhendong Liu (AAIM, 2020)

Approximating the Weighted Minimum Label s-t Cut Problem. - Peng Zhang 008 (CoRR, 2020)

Minimum Label s-t Cut has large integrality gaps. - Peng Zhang 008; Linqing Tang (Inf. Comput., 2020)

A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem. - Yong Chen 002; Guohui Lin; Tian Liu 001; Taibo Luo; Bing Su; Yao Xu; Peng Zhang 008 (J. Comb. Optim., 2020)

The seeding algorithm for k-means problem with penalties. - Min Li 028; Dachuan Xu; Jun Yue; Dongmei Zhang 002; Peng Zhang 008 (J. Comb. Optim., 2020)

Approximating Max k-Uncut via LP-rounding plus greed, with applications to Densest k-Subgraph. - Peng Zhang 008; Zhendong Liu (Theor. Comput. Sci., 2021)

The LP-rounding plus greed approach for partial optimization revisited. - Peng Zhang 008 (Frontiers Comput. Sci., 2022)

Simple Heuristics for the Rooted Max Tree Coverage Problem. - Jiang Zhou; Peng Zhang 008 (COCOA (1), 2023)

New approximation algorithms for the rooted Budgeted Cycle Cover problem. - Jiangkun Li; Peng Zhang 008 (Theor. Comput. Sci., 2023)

New algorithms for a simple measure of network partitioning. - Xueyang Zhao; Binghao Yan; Peng Zhang 008 (Theor. Comput. Sci., 2023)