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

APPROX

2000

Springer

2000

Springer

Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the general instance of the problem (directed or undirected), there is a simple 2k-approximation algorithm. Better algorithms are known for various ranges of n; k. For undirected graphs with metric costs Khuller and Raghavachari gave a 2 + 2(k 1) n approximation algorithm. We obtain the following results. (i) For arbitrary costs, a k-approximation algorithm for undirected graphs and a (k + 1)-approximation algorithm for directed graphs. (ii) For metric costs, a (2+ k 1 n )-approximation algorithm for undirected graphs and a (2 + k n )-approximation algorithm for directed graphs. For undirected graphs and k = 6; 7, we further improve the approximation ratio from k to d(k + 1)=2e = 4; previously, d(k + 1)=2e-approximation algorithms were known only for k 5. We also give a fast 3-approximation algorithm for k = 4. The...

Related Content

Added |
02 Aug 2010 |

Updated |
02 Aug 2010 |

Type |
Conference |

Year |
2000 |

Where |
APPROX |

Authors |
Guy Kortsarz, Zeev Nutov |

Comments (0)