Degree Bounded Network Design with Metric Costs

Abstract

Abstract. 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 a 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 the triangle inequality, there are constant factor approximation algorithms for various degree bounded network design problems. In global edge-connectivity, there is a (2 + 1 k )-approximation algorithm for the minimum bounded degree k-edge-connected subgraph problem. In local edge-connectivity, there is a 4-approximation algorithm for the minimum bounded degree Steiner network problem when rmax is even, and a 5.5-approximation algorithm when rmax is odd, where rmax is the maximum connectivity requirement. In global vertex-connectivity, there is a (2 + k−1 n + 1 k )-approximation algorithm for the minimum bounded degree k-vertex-connected subgraph problem when n ≥ 2k, where n is the number of vertices. For spanning tree, there is a (1 + 1 B−1 )-approximation algorithm for the minimum bounded degree spanning tree problem. These approximation algorithms return solutions with the smallest possible maximum degree, and in most cases the cost guarantee is obtained by comparing to the optimal cost when there are no degree constraints. This demonstrates that degree constraints can be incorporated into network design problems with metric costs. Our algorithms can be seen as a generalization of Christofides' algorithm for the metric traveling salesman problem. The main technical tool is a simplicity-preserving edge splitting-off operation, which is used to "short-cut" vertices with high degree while maintaining connectivity requirements and preserving simplicity of the solutions. 1. Introduction. Consider finding a minimum cost k-edge-subgraph with maximum degree at most B in a weighted undirected graph. This problem is a generalization of the traveling salesman problem (TSP) when k = B = 2 and the minimum bounded degree spanning tree problem when k = 1. In general this problem does not admit any polynomial time approximation algorithm, since the feasibility problem is already NP-hard. Recent research has thus focused on obtaining bicriteria approximation algorithms for degree bounded network design problems [19,31,39,32].In some network design problems the cost function satisfies the triangle inequality, and stronger algorithmic results are known [27,9,11]. For the TSP, although there is no polynomial factor approximation algorithm in general, it is well known that there is a 1.5-approximation algorithm assuming the triangle inequality [10]. This motivates us to study the more general degree bounded network design problems with metric costs.Formally, we are given a complete ...

Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities

“…The next lemma proved in [7] shows that if the conditions in Mader's theorem are satisfied, then there is no "3-dangerous-set structure". This lemma is important in the efficient edge splitting-off algorithm.…”

“…These edge splitting-off algorithms can be used directly to improve the running time of various graph algorithms [23,9,13,12,17,7]. For instance, using Theorem 2 in Gabow's local edge-connectivity augmentation algorithm [12] in unweighted graphs, the running time can be improved fromÕ(r max 2 n 3 ) tõ O(r max 2 n 2 ) time.…”

Approximation Algorithms for Connected Graph Factors of Minimum Weight

“…For k-vertexconnected spanning subgraphs of minimum weight without degree constraints, Kortsarz and Nutov [17, Theorem 4.2] gave a 2 + k−1 n -approximation algorithm. Min-kReg-kVertex and Min-kReg-kEdge admit constant factor approximations for all k ≥ 1 [1]. We refer to Tables 1 and 2 for an overview of results on k-vertexconnected and k-edge-connected d-factors.…”

Online and Stochastic Survivable Network Design

“…Cheriyan and Vetta [15] later gave O(1) approximations for the single source k-connected problem and a O(log rmax)-approximation for metric nodeconnected SNDP. Recently, Chan et al [11] give constant factor approximations for several degree bounded problems on metric graphs. As for inapproximability, Kortsarz et al [31] give 2 log 1−ε n hardness results for the node-connected survivable network design problem.…”