Survivable minimum bottleneck networks

DOI10.1016/J.COMGEO.2015.06.002MaRDI QIDQ904084zbMATH OpenOpenAlexFDO

Authors C. 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)

Recommendations

• An exact algorithm for the bottleneck 2-connected k-Steiner network problem in L_p planes
• Survivable network design problems in wireless networks
• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
• The bottleneck 2-connected k-Steiner network problem for k 2
• Optimal and approximate bottleneck Steiner trees

Cites work

• Almost tight upper bounds for lower envelopes in higher dimensions
• An output-sensitive approach for the \(L _{1}/L _{ \infty }\) \(k\)-nearest-neighbor Voronoi diagram
• Approximations for a bottleneck Steiner tree problem
• Exact algorithms for the bottleneck Steiner tree problem
• Minimum-weight two-connected spanning networks
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
• The 1-steiner tree problem
• The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
• The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\)
• The overlay of lower envelopes and its applications
• The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric

This page was built for publication: Survivable minimum bottleneck networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q904084)