Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs
In this paper, we study the minimum degree minimum spanning tree problem: Given a graph G = (V,E) and a non-negative cost function c on the edges, the objective is to find a minimum cost spanning tree T under the cost function c such that the maximum degree of any node in T is minimized.
We obtain an algorithm which returns an MST of maximum degree at most Δ*+k where Δ* is the minimum maximum degree of any MST and k is the distinct number of costs in any MST of G. We use a lower bound given by a linear programming relaxation to the problem and strengthen known graph-theoretic results on minimum degree subgraphs [3,5] to prove our result. Previous results for the problem [1,4] used a combinatorial lower bound which is weaker than the LP bound we use.
KeywordsSpan Tree Maximum Degree Minimum Span Tree Polynomial Time Algorithm Linear Programming Relaxation
Unable to display preview. Download preview PDF.
- 1.Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: What would Edmonds do? Augmenting Paths and Witnesses for degree-bounded MSTs. In: Proceedings of 8th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (2005)Google Scholar
- 2.Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: Push Relabel and an Improved Approximation Algorithm for the Bounded-degree MST Problem. In: ICALP (2006)Google Scholar
- 4.Fischer, T.: Optimizing the degree of minimum weight spanning trees. Technical report, Department of Computer Science, Cornell University (1993)Google Scholar
- 5.Furer, M., Raghavachari, B.: Approximating the minimum degree spanning tree to within one from the optimal degree. In: SODA 1992: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 317–324 (1992): Society for Industrial and Applied MathematicsGoogle Scholar
- 7.Goemans, M.: Personal CommunicationGoogle Scholar
- 11.Lam, F., Newman, A.: Traveling salesman path perfect graphs. Preprint (2006)Google Scholar
- 13.Ravi, R., Singh, M.: Delegate and Conquer: An LP-based approximation algorithm for Minimum Degree MSTs. Technical report, Tepper School of Business, Carnegie Mellon University (2006)Google Scholar