Degree Bounded Network Design with Metric Costs

Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum degree B satisfying given connectivity requirements. Even for simple connectivity requirement such as finding a spanning tree, computing a feasible solution for the degree bounded network design problem is already NP-hard, and thus there is no polynomial factor approximation algorithm for this problem. In this paper, we show that when the cost function satisfies triangle inequalities, there are constant factor approximation algorithms for various degree bounded network design problems. • Global edge-connectivity: There is a (2 + 1 k )approximation algorithm for the minimum bounded degree k-edge-connected subgraph problem. • Local edge-connectivity: There is a 6-approximation algorithm for the minimum bounded degree Steiner network problem. • Global vertex-connectivity: There is a (2 + k−1 n + 1 k )...

• Type: Conference
• Year: 2008
• Where: FOCS
• Authors: Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung
• Keywords: Degree Bounded Network, FOCS 2008, Minimum Bounded Degree, Network Design Problems, Theoretical Computer Science