On network design problems: fixed cost flows and the covering steiner problem
DOI10.1145/1077464.1077470zbMATH Open1321.68021OpenAlexW2018511415MaRDI QIDQ2944490FDOQ2944490
Guy Kortsarz, Guy Even, Wolfgang Slany
Publication date: 2 September 2015
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1077464.1077470
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)
Cited In (15)
- On fixed cost \(k\)-flow problems
- The Minimum Vulnerability Problem on Graphs
- The minimum degree group Steiner problem
- Network flow spanners
- Approximability of capacitated network design
- Models for a Steiner ring network design problem with revenues
- Combinatorial optimization in system configuration design
- On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
- The minimum vulnerability problem on specific graph classes
- Finding paths with minimum shared edges
- The minimum vulnerability problem
- Approximating \(k\)-generalized connectivity via collapsing HSTs
- Improved approximation algorithms for label cover problems
- Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications
- Resource allocation by means of project networks: Dominance results
This page was built for publication: On network design problems: fixed cost flows and the covering steiner problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944490)
