Journal of the ACM Bibliography
Samir Khuller and Uzi Vishkin. Biconnectivity
approximations and graph carvings. Journal of the ACM,
41(2):214-235, March 1994.
[BibTeX entry]
Selected papers that cite this one
- Joseph Cheriyan and Ramakrishna Thurimella. Approximating
minimum-size k-connected spanning subgraphs via matching
(extended abstract). In 37th Annual Symposium on Foundations
of Computer Science, pages 292-301, Burlington, Vermont, 14-16
October 1996. IEEE.
- Cristina G. Fernandes. A better approximation
ratio for the minimum k-edge-connected spanning subgraph
problem. In Proceedings of the Eighth Annual ACM-SIAM
Symposium on Discrete Algorithms, pages 629-638, New Orleans,
Louisiana, 5-7 January 1997.
- Cristina G. Fernandes. A better
approximation ratio for the minimum size k-edge-connected
spanning subgraph problem. Journal of Algorithms,
28(1):105-124, July 1998.
- Dorit S. Hochbaum. Approximation
algorithms for network design problems on bounded sets.
Journal of Algorithms, 21(2):403-414, September 1996.
- Samir Khuller and Balaji Raghavachari. Improved approximation
algorithms for uniform connectivity problems. In Proceedings
of the Twenty-Seventh Annual ACM Symposium on the Theory of
Computing, pages 1-10, Las Vegas, Nevada, 29 May-1 June 1995.
- Samir Khuller and Balaji Raghavachari. Improved
approximation algorithms for uniform connectivity problems.
Journal of Algorithms, 21(2):434-450, September 1996.
Selected references
- Joseph Cheriyan and Ramakrishna Thurimella. Algorithms for parallel
k-vertex connectivity and sparse certificates (extended
abstract). In Proceedings of the Twenty Third Annual ACM
Symposium on Theory of Computing, pages 391-401, New Orleans,
Louisiana, 6-8 May 1991.
- Greg N. Frederickson. Ambivalent data
structures for dynamic 2-edge-connectivity and k smallest
spanning trees. In 32nd Annual Symposium on Foundations of
Computer Science, pages 632-641, San Juan, Puerto Rico, 1-4
October 1991. IEEE.
- Harold N. Gabow. A
matroid approach to finding edge connectivity and packing
arborescences. In Proceedings of the Twenty Third Annual ACM
Symposium on Theory of Computing, pages 112-122, New Orleans,
Louisiana, 6-8 May 1991.
- Harold N. Gabow. Applications of a poset
representation to edge connectivity and graph rigidity. In
32nd Annual Symposium on Foundations of Computer Science,
pages 812-821, San Juan, Puerto Rico, 1-4 October 1991. IEEE.
- Zvi Galil and Giuseppe F. Italiano. Fully dynamic algorithms for
edge-connectivity problems (extended abstract). In Proceedings
of the Twenty Third Annual ACM Symposium on Theory of Computing,
pages 317-327, New Orleans, Louisiana, 6-8 May 1991.
- Tsan-sheng Hsu and Vijaya Ramachandran. A linear time algorithm for
triconnectivity augmentation (extended abstract). In 32nd
Annual Symposium on Foundations of Computer Science, pages
548-559, San Juan, Puerto Rico, 1-4 October 1991. IEEE.
- Dalit Naor, Dan Gusfield, and Charles Martel. A fast algorithm for
optimally increasing the edge-connectivity. In 31st Annual
Symposium on Foundations of Computer Science, volume II, pages
698-707, St. Louis, Missouri, 22-24 October 1990. IEEE.
Shortcuts: