Network design with edge-connectivity and degree constraints

Authors:
Takuro Fukunaga;Hiroshi Nagamochi
Affiliations:
Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan;Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan
Venue:
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Year:
2006

Citing 6
Cited 1

Augmenting graphs to meet edge-connectivity requirements

SIAM Journal on Discrete Mathematics
On a theorem of Mader

Discrete Mathematics - Special volume (part two) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs” (“The theory of regular graphs”)
Survivable networks, linear programming relaxations and the parsimonious property

Mathematical Programming: Series A and B
The primal-dual method for approximation algorithms and its application to network design problems

Approximation algorithms for NP-hard problems
Approximation algorithms

Approximation algorithms
Approximating a Generalization of Metric TSP

IEICE - Transactions on Information and Systems

Degree Bounded Network Design with Metric Costs

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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∈V is equal to b(v). This problem generalizes metric TSP. In this paper, we propose that the problem admits a ρ-approximation algorithm if b(v)≥2, v∈V, where ρ=2.5 if k is even, and ρ=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.