2006年
Network design with edge-connectivity and degree constraints
APPROXIMATION AND ONLINE ALGORITHMS
- ,
- 巻
- 4368
- 号
- 開始ページ
- 188
- 終了ページ
- 201
- 記述言語
- 英語
- 掲載種別
- 出版者・発行元
- SPRINGER-VERLAG BERLIN
We consider the following network design problem; Given a vertex set V with a metric cost c on V, an integer k >= 1, and a degree specification b, find a minimum cost k-edge-connected multigraph on V under the constraint that the degree of each vertex v G V is equal to b(v). This problem generalizes metric TSP. In this paper, we propose that the problem admits a p-approximation algorithm if b(v) ! 2, v G V, where rho = 2.5 if k is even, and p = 2.5 + 1.5/k if k is odd. We also prove that the digraph version of this problem admits a 2.5-approximation algorithm and discuss some generalization of metric TSP.
- リンク情報
- ID情報
-
- ISSN : 0302-9743
- Web of Science ID : WOS:000244556500015