Prize-collecting Steiner network problems
DOI10.1007/978-3-642-13036-6_6zbMATH Open1285.90049OpenAlexW2167294598MaRDI QIDQ3569809FDOQ3569809
Authors: Rohit Khandekar, Mohammad T. Hajiaghayi, Guy Kortsarz, Zeev Nutov 
Publication date: 22 June 2010
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13036-6_6
Recommendations
- Prize-collecting steiner network problems
- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements
- Elementary approximation algorithms for prize collecting Steiner tree problems
- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
- Prize-collecting survivable network design in node-weighted graphs
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cited In (10)
- Prize-collecting Steiner networks via iterative rounding
- On some network design problems with degree constraints
- Prize-collecting steiner network problems
- Approximation algorithm for the partial set multi-cover problem
- Approximation algorithms for the submodular edge cover problem with submodular penalties
- Title not available (Why is that?)
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties
- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements
- A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
- Spider covers for prize-collecting network activation problem
This page was built for publication: Prize-collecting Steiner network problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569809)
