论文信息 - Approximating the minmax rooted-tree cover in a tree

Approximating the minmax rooted-tree cover in a tree

Abstract Given an edge-weighted rooted tree T and a positive integer p ( ⩽ n ) , where n is the number of vertices in T , we cover all vertices in T by a set of p subtrees each of which contains the root r of T . The minmax rooted-tree cover problem asks to find such a set of p subtrees so as to minimize the maximum weight of the subtrees in the set. In this paper, we propose an O ( n ) time ( 2 + e ) -approximation algorithm to the problem, where e > 0 is a prescribed constant.

Hiroshi Nagamochi | Kohei Okada

[1] Bruce L. Golden,et al. VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[2] Hiroshi Nagamochi. Approximating the Minmax Rooted-Subtree Cover Problem , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4] John L. Bruno,et al. Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs , 1978, SIAM J. Comput..

[5] Gilbert Laporte,et al. Location routing problems , 1987 .

[6] Hiroshi Nagamochi,et al. Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem , 2003, ISAAC.

[7] R. Ravi,et al. Min-max tree covers of graphs , 2004, Oper. Res. Lett..

[8] Oded Berman,et al. A Heuristic with Worst-case Analysis for Minimax Routing of Two Travelling Salesmen on a Tree , 1996, Discret. Appl. Math..

[9] Hiroshi Nagamochi,et al. 2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times , 2003, Discret. Appl. Math..