Approximation hardness of min-max tree covers

被引：23

作者：

Xu, Zhou ^{[1
]}

Wen, Qi ^{[2
]}

机构：

[1] Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Hong Kong, Hong Kong, Peoples R China

[2] City Univ Hong Kong, Dept Management Sci, Hong Kong, Hong Kong, Peoples R China

来源：

OPERATIONS RESEARCH LETTERS | 2010年 / 38卷 / 03期

关键词：

Inapproximability bound; Min-max; Vehicle routing; Tree covers; TRAVELING SALESMEN; ALGORITHMS;

D O I：

10.1016/j.orl.2010.02.004

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We prove the first inapproximability bounds to study approximation hardness for a min-max k-tree cover problem and its variants. The problem is to find a set of k trees to cover vertices of a given graph with metric edge weights, so as to minimize the maximum total edge weight of any of the k trees. Our technique can also be applied to improve inapproximability bounds for min-max problems that use other covering objectives, such as stars, paths, and tours. (C) 2010 Elsevier B.V. All rights reserved.

引用

页码：169 / 173

页数：5

共 50 条

[1] Approximation hardness of min-max tree covers (vol 38, pg 169, 2010)
Xu, Zhou
Wen, Qi
OPERATIONS RESEARCH LETTERS, 2013, 41 (05) : 563 - 563
[2] Min-max tree covers of graphs
Even, G
Garg, N
Könemann, J
Ravi, R
Sinha, A
OPERATIONS RESEARCH LETTERS, 2004, 32 (04) : 309 - 315
[3] Approximation algorithms for min-max tree partition
GuttmannBeck, N
Hassin, R
JOURNAL OF ALGORITHMS, 1997, 24 (02) : 266 - 286
[4] GAME TREE SEARCHING BY MIN-MAX APPROXIMATION
RIVEST, RL
ARTIFICIAL INTELLIGENCE, 1987, 34 (01) : 77 - 96
[5] Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems
Aissi H.
4OR, 2006, 4 (4) : 347 - 350
[6] Parallel Approximation of Min-Max Problems
Gus Gutoski
Xiaodi Wu
computational complexity, 2013, 22 : 385 - 428
[7] Parallel Approximation of Min-Max Problems
Gutoski, Gus
Wu, Xiaodi
COMPUTATIONAL COMPLEXITY, 2013, 22 (02) : 385 - 428
[8] Approximation of min-max and min-max regret versions of some combinatorial optimization problems
Aissi, Hassene
Bazgan, Cristina
Vanderpooten, Daniel
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (02) : 281 - 290
[9] Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems
M. Reza Khani
Mohammad R. Salavatipour
Algorithmica, 2014, 69 : 443 - 460
[10] Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems
Khani, M. Reza
Salavatipour, Mohammad R.
ALGORITHMICA, 2014, 69 (02) : 443 - 460

← 1 2 3 4 5 →