Survivable network activation problems
From MaRDI portal
Publication:386909
DOI10.1016/J.TCS.2012.10.054zbMATH Open1277.68025OpenAlexW2122343760MaRDI QIDQ386909FDOQ386909
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
Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation algorithms for combinatorial problems
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- Rooted \(k\)-connections in digraphs
- Approximating node connectivity problems via set covers
- Approximating subset \(k\)-connectivity problems
- Approximating minimum power edge-multi-covers
- 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
- 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
Cited In (3)
This page was built for publication: Survivable network activation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386909)
