Relay placement for two-connectivity
From MaRDI portal
Publication:2339829
DOI10.1016/j.disopt.2014.06.002zbMath1308.90186OpenAlexW2074123869MaRDI QIDQ2339829
Publication date: 9 April 2015
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2014.06.002
Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Steiner tree problem with minimum number of Steiner points and bounded edge-length
- Relay placement for fault tolerance in wireless networks in higher dimensions
- Survivable networks, linear programming relaxations and the parsimonious property
- Wireless network design via 3-decompositions
- An application of submodular flows
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
- A matroid approach to finding edge connectivity and packing arborescences
- Low-degree minimum spanning trees
- On the structure and complexity of the 2-connected Steiner network problem in the plane
- Bounding component sizes of two-connected Steiner networks
- Two-connected Steiner networks: structural properties
- Low-degree minimal spanning trees in normed spaces
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Approximating Survivable Networks with Minimum Number of Steiner Points
- Vertex-disjoint paths and edge-disjoint branchings in directed graphs
- Biconnectivity approximations and graph carvings
- A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
- Improved Approximation Algorithms for Uniform Connectivity Problems
- Approximations for Steiner trees with minimum number of Steiner points
This page was built for publication: Relay placement for two-connectivity
