Survivable network activation problems
From MaRDI portal
Publication:386909
DOI10.1016/j.tcs.2012.10.054zbMath1277.68025OpenAlexW2122343760MaRDI QIDQ386909
Publication date: 11 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.054
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items (3)
Minimum shared‐power edge cut ⋮ Spider Covering Algorithms for Network Design Problems ⋮ Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks
Cites Work
- Unnamed Item
- Unnamed Item
- Approximating minimum power edge-multi-covers
- Power optimization for connectivity problems
- On minimum power connectivity problems
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems
- A note on Rooted Survivable Networks
- Rooted \(k\)-connections in digraphs
- Approximation algorithms for combinatorial problems
- Approximating node connectivity problems via set covers
- Approximating subset \(k\)-connectivity problems
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Detecting high log-densities
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
- Approximating Steiner Networks with Node-Weights
- Approximating k-node Connected Subgraphs via Critical Graphs
This page was built for publication: Survivable network activation problems
