Better approximability results for min–max tree/cycle/path cover problems

被引：4
作者：
Wei Yu
Zhaohui Liu
机构：
[1] East China University of Science and Technology,Department of Mathematics
来源：
Journal of Combinatorial Optimization | 2019年 / 37卷
关键词：
Approximation hardness; Approximation algorithm; Tree cover; Cycle cover; Path cover; Traveling salesman problem;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We study the problem of covering the vertices of an undirected weighted graph with a given number of trees (cycles, paths) to minimize the weight of the maximum weight tree (cycle, path). Improved inapproximability lower bounds are proved and better approximation algorithms are designed for several variants of this problem.
引用
收藏
页码：563 / 578
页数：15
相关论文
共 46 条
[1]  
Arkin EM(2006)Approximations for minimum and min–max vehicle routing problems J Algorithms 59 1-18
[2]  
Hassin R(2008)Routing for relief efforts Transp Sci 42 127-145
[3]  
Levin A(1986)Planar 3DM is NP-complete J Algroithms 7 174-184
[4]  
Campbell AM(2004)Min–max tree covers of graphs Oper Res Lett 32 309-315
[5]  
Vandenbussche D(2015)Min–max cover of a graph with a small number of parts Discrete Optim 16 51-61
[6]  
Hermann W(1978)Approximation algorithms for some routing problems SIAM J Comput 7 178-193
[7]  
Dyer M(1973)An SIAM J Comput 2 225-231
[8]  
Frieze A(2011) algorithm for maximum matchings in bipartite graphs J Graph Algorithms Appl 15 345-371
[9]  
Even G(2003)Minmax tree cover in the Euclidean space Discrete Appl Math 129 433-447
[10]  
Garg N(2014)2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times Algorithmica 69 443-460
12345