scientific article
From MaRDI portal
Publication:2934723
zbMath1302.90238MaRDI QIDQ2934723
Yogeshwer Sharma, David P. Williamson, Chaitanya Swamy
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Trees (05C05) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (12)
An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties ⋮ An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties ⋮ Equivalence of convex minimization problems over base polytopes ⋮ Approximation algorithms for prize-collecting capacitated network design problems ⋮ Euclidean prize-collecting Steiner forest ⋮ A primal-dual algorithm for the generalized prize-collecting Steiner forest problem ⋮ Approximating \(k\)-generalized connectivity via collapsing HSTs ⋮ Online constrained forest and prize-collecting network design ⋮ Elementary approximation algorithms for prize collecting Steiner tree problems ⋮ Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements ⋮ Approximation algorithms for the multiprocessor scheduling with submodular penalties ⋮ Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This page was built for publication:
