Prize-collecting Steiner network problems

DOI10.1007/978-3-642-13036-6_6MaRDI QIDQ3569809zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

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

Cited in

(12)

• Approximation algorithm for the partial set multi-cover problem
• Approximation algorithms for the submodular edge cover problem with submodular penalties
• An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties
• Prize-collecting steiner network problems
• Prize-collecting survivable network design in node-weighted graphs
• A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
• On some network design problems with degree constraints
• Prize-collecting Steiner networks via iterative rounding
• Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements
• Spider covers for prize-collecting network activation problem
• scientific article; zbMATH DE number 6783450 (Why is no real title available?)
• Prize-collecting forest with submodular penalties: improved approximation

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)