Approximation Algorithms and Hardness Results for Labeled Connectivity Problems
From MaRDI portal
Publication:5756701
DOI10.1007/11821069_42zbMath1132.68820OpenAlexW1909158042MaRDI QIDQ5756701
Refael Hassin, Jérôme Monnot, Danny Segev
Publication date: 5 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11821069_42
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Connectivity (05C40)
Related Items (1)
This page was built for publication: Approximation Algorithms and Hardness Results for Labeled Connectivity Problems