Inapproximability of Survivable Networks

DOI10.1007/978-3-540-85363-3_12zbMath1159.68670MaRDI QIDQ3541792

Zeev Nutov, Yuval Lando

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85363-3_12

Mathematics Subject Classification ID

90C27: Combinatorial optimization

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms

05C40: Connectivity