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

FOCS

2008

IEEE

2008

IEEE

Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to ﬁnd a minimum cost simple subgraph with maximum degree B satisfying given connectivity requirements. Even for simple connectivity requirement such as ﬁnding 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 satisﬁes 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 )...

Related Content

Added |
29 May 2010 |

Updated |
29 May 2010 |

Type |
Conference |

Year |
2008 |

Where |
FOCS |

Authors |
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung |

Comments (0)