External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem

Prabhakar Gubbala, Balaji Raghavachari. Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem. In Michael Jünger, Volker Kaibel, editors, Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings. Volume 3509 of Lecture Notes in Computer Science, pages 422-436, Springer, 2005. [doi]

Authors

Prabhakar Gubbala

This author has not been identified. Look up 'Prabhakar Gubbala' in Google

Balaji Raghavachari

This author has not been identified. Look up 'Balaji Raghavachari' in Google
runs on