Minimum-weight two-connected spanning networks
Mathematical Programming: Series A and B
On the structure of minimum-weight k-connected spanning networks
SIAM Journal on Discrete Mathematics
Augmenting graphs to meet edge-connectivity requirements
SIAM Journal on Discrete Mathematics
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”)
Transitions in geometric minimum spanning trees
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
On the optimal vertex-connectivity augmentation
Journal of Combinatorial Theory Series B
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
SIAM Journal on Discrete Mathematics
A network-flow technique for finding low-weight bounded-degree spanning trees
Journal of Algorithms
Edge-Connectivity Augmentation Preserving Simplicity
SIAM Journal on Discrete Mathematics
Low-Degree Spanning Trees of Small Weight
SIAM Journal on Computing
Edge-disjoint trees containing some given vertices in a graph
Journal of Combinatorial Theory Series B
Constrained Edge-Splitting Problems
SIAM Journal on Discrete Mathematics
Network failure detection and graph connectivity
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Euclidean Bounded-Degree Spanning Tree Ratios
Discrete & Computational Geometry
Minimum Bounded Degree Spanning Trees
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Approximating a Generalization of Metric TSP
IEICE - Transactions on Information and Systems
Survivable network design with degree or order constraints
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximating minimum bounded degree spanning trees to within one of optimal
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximation Algorithms for Network Design with Metric Costs
SIAM Journal on Discrete Mathematics
Additive approximation for bounded degree survivable network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Degree-bounded minimum spanning trees
Discrete Applied Mathematics
A new approach to splitting-off
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Network design with edge-connectivity and degree constraints
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Degree-Constrained node-connectivity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Hi-index | 0.00 |
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+\frac{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 $r_{\max}$ is even, and a 5.5-approximation algorithm when $r_{\max}$ is odd, where $r_{\max}$ is the maximum connectivity requirement. In global vertex-connectivity, there is a $(2+\frac{k-1}{n}+\frac{1}{k})$-approximation algorithm for the minimum bounded degree $k$-vertex-connected subgraph problem when $n\geq2k$, where $n$ is the number of vertices. For spanning tree, there is a $(1+\frac{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.