Relay placement for two-connectivity

DOI10.1016/J.DISOPT.2014.06.002MaRDI QIDQ2339829zbMATHOpenAlexFDO

Authors Gruia Calinescu

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

zbMATH Keywords

parsimonyapproximation algorithmSteiner pointswireless networksubmodular flowstwo connectivity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18)

Recommendations

• Improved approximation algorithms for single-tiered relay placement
• Relay placement for fault tolerance in wireless networks in higher dimensions
• Computing and Combinatorics
• On optimal placement of relay nodes for reliable connectivity in wireless sensor networks

Cites work

• scientific article; zbMATH DE number 3884935 (Why is no real title available?)
• scientific article; zbMATH DE number 1223730 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
• A matroid approach to finding edge connectivity and packing arborescences
• A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
• An application of submodular flows
• Approximations for Steiner trees with minimum number of Steiner points
• Biconnectivity approximations and graph carvings
• Bounding component sizes of two-connected Steiner networks
• Connections in combinatorial optimization
• Improved Approximation Algorithms for Uniform Connectivity Problems
• Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
• Low-degree minimal spanning trees in normed spaces
• Low-degree minimum spanning trees
• On the structure and complexity of the 2-connected Steiner network problem in the plane
• Relay placement for fault tolerance in wireless networks in higher dimensions
• Steiner tree problem with minimum number of Steiner points and bounded edge-length
• Survivable networks, linear programming relaxations and the parsimonious property
• Two-connected Steiner networks: structural properties
• Vertex-disjoint paths and edge-disjoint branchings in directed graphs
• Wireless network design via 3-decompositions

Cited in

(3)

• Relay placement for fault tolerance in wireless networks in higher dimensions
• On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
• Improved approximation algorithms for single-tiered relay placement

This page was built for publication: Relay placement for two-connectivity

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