Improved approximation algorithms for uniform connectivity problems

@inproceedings{Khuller1995ImprovedAA,
  title={Improved approximation algorithms for uniform connectivity problems},
  author={Samir Khuller and Balaji Raghavachari},
  booktitle={STOC},
  year={1995}
}
The problem of finding minimum weight spanning subgraphs with a given connectivity requirement is considered. The problem is NP-hard when the connectivity requirement is greater than one. Polynomial time approximation algorithms for various weighted and unweighed connectivity problems are given. The following results are presented: 
Highly Influential
This paper has highly influenced 20 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

An application of submodular ows

  • A. Frank, E. Tardos
  • Linear Algebra and its Applications, 114/115, pp…
  • 1989
Highly Influential
8 Excerpts

Techniques for the design of parallel graph algorithms

  • R. Thurimella
  • Ph.D thesis, Dept. of Computer Science, The…
  • 1989
Highly Influential
8 Excerpts

Similar Papers

Loading similar papers…