On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem

DOI10.1007/3-540-45471-3_33MaRDI QIDQ3046506zbMATH OpenOpenAlexFDO

Authors Guy Even, Wolfgang Slany, Guy Kortsarz

Publication date 12 August 2004

Published in Algorithm Theory — SWAT 2002 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45471-3_33

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• On network design problems: fixed cost flows and the covering Steiner problem
• Steiner problem in networks: A survey
• Approaches to the Steiner Problem in Networks
• The minimum cover flow problem in networks
• scientific article; zbMATH DE number 556046
• Network design and flow problems with cross-arc costs
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• On minimum concave cost network flow problems
• On fixed cost k-flow problems
• On fixed cost \(k\)-flow problems

Cited in

(8)

• On a class of branching problems in broadcasting and distribution
• The polymatroid Steiner problems
• A greedy approximation algorithm for the group Steiner problem
• On fixed cost k-flow problems
• On network design problems: fixed cost flows and the covering Steiner problem
• Network design with coverage costs
• On fixed cost \(k\)-flow problems
• Single-sink fractionally subadditive network design

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 Q3046506)