Fingerprint
Dive into the research topics of 'Finding optimum k-vertex connected spanning subgraphs: Improved approximation algorithms for k=3, 4, 5'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
Finding optimum k-vertex connected spanning subgraphs: Improved approximation algorithms for k=3, 4, 5
Yefim Dinitz, Zeev Nutov
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review