de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44329

Dinitz,  Yefim
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45135

Nutov,  Zeev
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Dinitz, Y., & Nutov, Z. (1999). A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs. Journal of Algorithms, 32(1), 21-30.


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