Survivable minimum bottleneck networks
From MaRDI portal
Publication:904084
DOI10.1016/J.COMGEO.2015.06.002zbMATH Open1332.65033OpenAlexW1052287810MaRDI QIDQ904084FDOQ904084
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
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 \leq 2\)
- Optimal and approximate bottleneck Steiner trees
polynomial time algorithmwireless ad-hoc networksnormed (Minkowski) planesoriented Dirichlet cellssurvivable bottleneck Steiner networks
Cites Work
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\)
- Minimum-weight two-connected spanning networks
- Almost tight upper bounds for lower envelopes in higher dimensions
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
- Approximations for a bottleneck Steiner tree problem
- The overlay of lower envelopes and its applications
- An output-sensitive approach for the \(L _{1}/L _{ \infty }\) \(k\)-nearest-neighbor Voronoi diagram
- Exact algorithms for the bottleneck Steiner tree problem
- The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric
- The 1-steiner tree problem
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
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)
