Peng Zhang

68 papers B 2C 14Misc 2Journal 40Unranked 10
YearRankTypeTitle / Venue / Authors
2026 C ed.
Theory and Applications of Models of Computation - 19th Annual Conference, TAMC 2025, Jinan, China, September 19-21, 2025, Proceedings
TAMC
Min Li, Mingji Xia, Peng Zhang
2025 — conf
A Simple Heuristic Finding Connectivity Bottleneck in Networks with Shared Risk Resource Groups.
WASA (2)
Yizhe Tong, Pengzhi Gao, Peng Zhang
2025 J jnl
An Evolutionary Algorithm Based on CMSA for Rooted Max Tree Coverage.
IEEE Trans. Evol. Comput.
Jiang Zhou, Peng Zhang
2024 — conf
A Short Proof and Experimental Study of the Approximation Algorithm for Label s-t Cut.
COCOA (1)
Peng Zhang
2024 J jnl
Combining Capacity and Length: Finding Connectivity Bottleneck in a Layered Network.
IEEE/ACM Trans. Netw.
Peng Zhang
2023 J jnl
New algorithms for a simple measure of network partitioning.
Theor. Comput. Sci.
Xueyang Zhao, Binghao Yan, Peng Zhang
2023 J jnl
New approximation algorithms for the rooted Budgeted Cycle Cover problem.
Theor. Comput. Sci.
Jiangkun Li, Peng Zhang
2023 — conf
Simple Heuristics for the Rooted Max Tree Coverage Problem.
COCOA (1)
Jiang Zhou, Peng Zhang
2022 C conf
New Algorithms for a Simple Measure of Network Partitioning.
TAMC
Xueyang Zhao, Binghao Yan, Peng Zhang
2022 J jnl
The LP-rounding plus greed approach for partial optimization revisited.
Frontiers Comput. Sci.
Peng Zhang
2021 J jnl
Approximating Max
Theor. Comput. Sci.
Peng Zhang, Zhendong Liu
2021 C conf
New Approximation Algorithms for the Rooted Budgeted Cycle Cover Problem.
COCOA
Jiangkun Li, Peng Zhang
2020 J jnl
A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem.
J. Comb. Optim.
Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu, Peng Zhang
2020 C conf
Approximating Max k-Uncut via LP-rounding Plus Greed, with Applications to Densest k-Subgraph.
AAIM
Peng Zhang, Zhendong Liu
2020 J jnl
Approximating the Weighted Minimum Label s-t Cut Problem.
CoRR
Peng Zhang
2020 J jnl
Minimum Label
Inf. Comput.
Peng Zhang, Linqing Tang
2020 J jnl
The seeding algorithm for k-means problem with penalties.
J. Comb. Optim.
Min Li, Dachuan Xu, Jun Yue, Dongmei Zhang, Peng Zhang
2019 J jnl
An approximation algorithm for genome sorting by reversals to recover all adjacencies.
J. Comb. Optim.
Shanshan Zhai, Peng Zhang, Daming Zhu, Weitian Tong, Yao Xu, Guohui Lin
2019 J jnl
Local search approximation algorithms for the sum of squares facility location problems.
J. Glob. Optim.
Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang, Zhenning Zhang
2019 J jnl
Minimum Label s-t Cut has Large Integrality Gaps.
CoRR
Peng Zhang, Linqing Tang
2018 J jnl
A local search approximation algorithm for a squared metric k-facility location problem.
J. Comb. Optim.
Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang, Zhenning Zhang
2018 J jnl
Approximation algorithms for the robust/soft-capacitated 2-level facility location problems.
J. Glob. Optim.
Chenchen Wu, Dachuan Xu, Dongmei Zhang, Peng Zhang
2018 J jnl
Approximation and hardness results for the Max
Theor. Comput. Sci.
Peng Zhang, Chenchen Wu, Dachuan Xu
2018 J jnl
Computing and estimating the volume of the solution space of SMT(LA) constraints.
Theor. Comput. Sci.
Cunjing Ge, Feifei Ma, Peng Zhang, Jian Zhang
2018 J jnl
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems.
Algorithmica
Peng Zhang, Yao Xu, Tao Jiang, Angsheng Li, Guohui Lin, Eiji Miyano
2018 J jnl
Simpler and Better Approximation Algorithms for the Unweighted Minimum Label s-t Cut Problem.
Algorithmica
Peng Zhang, Bin Fu, Linqing Tang
2017 B conf
A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem.
ISAAC
Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Peng Zhang
2017 — conf
A Local Search Approximation Algorithm for a Squared Metric k-Facility Location Problem.
COCOA (1)
Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang, Zhenning Zhang
2016 J jnl
A new approximation algorithm for the unbalanced Min s-t Cut problem.
Theor. Comput. Sci.
Peng Zhang
2016 C conf
Approximation and Hardness Results for the Max k-Uncut Problem.
COCOA
Peng Zhang, Chenchen Wu, Dachuan Xu, Xinghe Zhang
2016 J jnl
The label cut problem with respect to path length and label frequency.
Theor. Comput. Sci.
Peng Zhang, Bin Fu
2015 J jnl
Algorithmic aspects of homophyly of networks.
Theor. Comput. Sci.
Peng Zhang, Angsheng Li
2015 Misc conf
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems.
COCOON
Peng Zhang, Tao Jiang, Angsheng Li
2015 J jnl
Improved parameterized and exact algorithms for cut problems on trees.
Theor. Comput. Sci.
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
2014 Misc conf
A New Approximation Algorithm for the Unbalanced Min s-t Cut Problem.
COCOON
Peng Zhang
2014 J jnl
A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design.
J. Comb. Optim.
Peng Zhang
2014 C conf
Algorithms for Cut Problems on Trees.
COCOA
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
2014 C conf
Efficient Algorithms for the Label Cut Problems.
TAMC
Peng Zhang
2014 J jnl
On the generalized multiway cut in trees problem.
J. Comb. Optim.
Hong Liu, Peng Zhang
2014 J jnl
Unbalanced graph cuts with minimum capacity.
Frontiers Comput. Sci.
Peng Zhang
2013 J jnl
Algorithms for Cut Problems on Trees
CoRR
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
2013 J jnl
Complexity and Approximation Results for the Min-Sum and Min-Max Disjoint Paths Problems.
Comput. Informatics
Peng Zhang, Wenbo Zhao, Daming Zhu
2013 J jnl
Unbalanced Graph Partitioning.
Theory Comput. Syst.
Angsheng Li, Peng Zhang
2012 J jnl
Algorithmic Aspects of Homophyly of Networks
CoRR
Angsheng Li, Peng Zhang
2012 J jnl
An approximation algorithm for the Generalized k-Multicut problem.
Discret. Appl. Math.
Peng Zhang, Daming Zhu, Junfeng Luan
2012 B conf
Approximating Minimum Label s-t Cut via Linear Programming.
LATIN
Linqing Tang, Peng Zhang
2012 — conf
On Editing Graphs into 2-Club Clusters.
FAW-AAIM
Hong Liu, Peng Zhang, Daming Zhu
2012 C conf
On the Generalized Multiway Cut in Trees Problem.
COCOA
Hong Liu, Peng Zhang
2012 J jnl
Scheduling mobile collaborating workforce for multiple urgent events.
J. Netw. Comput. Appl.
Yuqing Sun, Dickson K. W. Chiu, Bin Gong, Xiangxu Meng, Peng Zhang
2011 C conf
A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design.
COCOA
Peng Zhang
2011 J jnl
Approximation and hardness results for label cut and related problems.
J. Comb. Optim.
Peng Zhang, Jin-Yi Cai, Linqing Tang, Wenbo Zhao
2011 J jnl
Rent-or-Buy Network Design Problem and the Sample-Augment Algorithm: A Survey.
Int. J. Softw. Informatics
Peng Zhang
2010 — conf
A trust-based multipath routing framework for Mobile Ad hoc NETworks.
FSKD
Xin Li, Zhiping Jia, Peng Zhang, Haiyang Wang
2010 — conf
Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors.
CATS
Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Peng Zhang
2010 J jnl
Trust-based on-demand multipath routing in mobile ad hoc networks.
IET Inf. Secur.
Xin Li, Zhiping Jia, Peng Zhang, Ruihua Zhang, Haiyang Wang
2010 — conf
Unbalanced Graph Partitioning.
ISAAC (1)
Angsheng Li, Peng Zhang
2009 — conf
A Bicriteria Approximation Algorithm for Generalized k-Multicut in Trees.
CSO (2)
Peng Zhang, Daming Zhu, Junfeng Luan
2009 J jnl
An approximation algorithm to the k-Steiner Forest problem.
Theor. Comput. Sci.
Peng Zhang, Mingji Xia
2009 C conf
Approximation and Hardness Results for Label Cut and Related Problems.
TAMC
Peng Zhang, Jin-Yi Cai, Linqing Tang, Wenbo Zhao
2008 J jnl
On Constrained Facility Location Problems.
J. Comput. Sci. Technol.
Wei-Lin Li, Peng Zhang, Daming Zhu
2007 J jnl
A new approximation algorithm for the k-facility location problem.
Theor. Comput. Sci.
Peng Zhang
2007 C conf
An Approximation Algorithm to the
TAMC
Peng Zhang
2007 C conf
Approximating Generalized Multicut on Trees.
CiE
Peng Zhang
2007 C conf
Approximation to the Minimum Rooted Star Cover Problem.
TAMC
Wenbo Zhao, Peng Zhang
2007 J jnl
Computational complexity of counting problems on 3-regular planar graphs.
Theor. Comput. Sci.
Mingji Xia, Peng Zhang, Wenbo Zhao
2007 — conf
On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems.
ESCAPE
Peng Zhang, Wenbo Zhao
2006 C conf
A New Approximation Algorithm for the
TAMC
Peng Zhang
2006 J jnl
A network flow approach to the Minimum Common Integer Partition Problem.
Theor. Comput. Sci.
Wenbo Zhao, Peng Zhang, Tao Jiang