English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph

MPS-Authors
/persons/resource/persons44329

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

/persons/resource/persons45135

Nutov,  Zeev
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

Auletta, V., Dinitz, Y., Nutov, Z., & Parente, D. (1999). A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph. Journal of Algorithms, 32(1), 21-30.


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