Approximating Survivable Networks with Minimum Number of Steiner Points

DOI10.1007/978-3-642-18318-8_14zbMath1314.68399arXiv1304.7571MaRDI QIDQ3075458

Zeev Nutov, Lior Kamma

Publication date: 15 February 2011

Published in: Networks, Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.7571

zbMATH Keywords

approximation algorithms; sensor networks; node-connectivity; unit disc graphs; unit-disc graphs

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C82: Small world graphs, complex networks (graph-theoretic aspects)

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

68M14: Distributed systems

68W25: Approximation algorithms

05C40: Connectivity

05C62: Graph representations (geometric and intersection representations, etc.)