Survivable minimum bottleneck networks

DOI10.1016/j.comgeo.2015.06.002zbMath1332.65033OpenAlexW1052287810MaRDI QIDQ904084

Charl J. Ras

Publication date: 15 January 2016

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2015.06.002

zbMATH Keywords

polynomial time algorithmwireless ad-hoc networksnormed (Minkowski) planesoriented Dirichlet cellssurvivable bottleneck Steiner networks

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\)
• Minimum-weight two-connected spanning networks
• Exact algorithms for the bottleneck Steiner tree problem
• The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric
• Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
• Almost tight upper bounds for lower envelopes in higher dimensions
• Approximations for a bottleneck Steiner tree problem
• The overlay of lower envelopes and its applications
• The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
• Approximating Survivable Networks with Minimum Number of Steiner Points
• An Output-Sensitive Approach for the L 1/L  ∞  k-Nearest-Neighbor Voronoi Diagram
• The 1-steiner tree problem
• On k-Nearest Neighbor Voronoi Diagrams in the Plane

This page was built for publication: Survivable minimum bottleneck networks