Approximating a Generalization of Metric TSP

Authors:
Takuro Fukunaga;Hiroshi Nagamochi
Affiliations:
The authors are with the Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto-shi, 606--8501 Japan. E-mail: takuro@amp.i.kyoto-u.ac.jp, E-mail: na ...;The authors are with the Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto-shi, 606--8501 Japan. E-mail: takuro@amp.i.kyoto-u.ac.jp, E-mail: na ...
Venue:
IEICE - Transactions on Information and Systems
Year:
2007

Citing 0
Cited 2

Degree Bounded Network Design with Metric Costs

SIAM Journal on Computing
Network design with edge-connectivity and degree constraints

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a problem for constructing a minimum cost r-edge-connected multigraph in which degree d(v) of each vertex v ε V is specified. In this paper, we propose a 3-approximation algorithm for this problem under the assumption that edge cost is metric, r(u, v) ε {1, 2} for each u, v ε V, and d(v) ≥ 2 for each v ε V. This problem is a generalization of metric TSP. We also propose an approximation algorithm for the digraph version of the problem.