Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

STOC

2007

ACM

2007

ACM

In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of minimum cost which satisfies all the degree bounds. Let OPT be the cost of an optimal solution to this problem. In this paper, we present a polynomial time algorithm which returns a spanning tree T of cost at most OPT and dT (v) Bv + 1 for all v, where dT (v) denotes the degree of v in T. This generalizes a result of Furer and Raghavachari [8] to weighted graphs, and settles a 15-year-old conjecture of Goemans [10] affirmatively. The algorithm generalizes when each vertex v has a degree lower bound Av and a degree upper bound Bv, and returns a spanning tree with cost at most OPT and Av - 1 dT (v) Bv + 1 for all v. This is essentially the best possible. The main technique used is an extension of the iterative rounding method introduced by Jain [12] for the design of approximation algorithms. Categories and Sub...

Related Content

Added |
03 Dec 2009 |

Updated |
03 Dec 2009 |

Type |
Conference |

Year |
2007 |

Where |
STOC |

Authors |
Mohit Singh, Lap Chi Lau |

Comments (0)