English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Approximation Algorithms for Minimum Size 2-connectivity Problems

MPS-Authors
/persons/resource/persons44853

Krysta,  Piotr
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44863

Kumar,  V. S. Anil
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Krysta, P., & Kumar, V. S. A. (2001). Approximation Algorithms for Minimum Size 2-connectivity Problems. In A. Ferreira, & H. Reichel (Eds.), Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS-01) (pp. 431-442). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3170-0
Abstract
There is no abstract available