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

DOI10.1007/3-540-45471-3_33zbMath1078.68536OpenAlexW1484655266MaRDI QIDQ3046506

Wolfgang Slany, Guy Even, 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

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

Related Items (3)

On a class of branching problems in broadcasting and distribution ⋮ The polymatroid Steiner problems ⋮ A greedy approximation algorithm for the group Steiner problem

This page was built for publication: On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem