Approximating the smallest k -edge connected spanning subgraph by LP-rounding

Approximating the smallest k-edge connected spanning subgraph by LP-rounding

Full Text:

Pdf

Buy this Article

Authors:	Harold N. Gabow	University of Colorado at Boulder, Boulder, CO
	Michel X. Goemans	MIT, Cambridge, MA
	Éva Tardos	Cornell University, Ithaca, NY
	David P. Williamson	Cornell University, Ithaca, NY

	2005 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 16 · Citation Count: 4

Published in:

· Proceeding

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2005
table of contents ISBN:0-89871-585-7