The primal-dual method for approximation algorithms
From MaRDI portal
Publication:1849526
DOI10.1007/s101070100262zbMath1030.90111OpenAlexW2161836078MaRDI QIDQ1849526
Publication date: 1 December 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100262
Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Approximation algorithms (68W25)
Related Items (9)
An approximation algorithm for submodular hitting set problem with linear penalties ⋮ Using fractional primal-dual to schedule split intervals with demands ⋮ Improved solution to data gathering with mobile mule ⋮ Improved Approximation Algorithm for the Combination of Parallel Machine Scheduling and Vertex Cover ⋮ Combination of parallel machine scheduling and vertex cover ⋮ Worst-case performance of Wong's Steiner tree heuristic ⋮ The set covering problem revisited: an empirical study of the value of dual information ⋮ A primal-dual approximation algorithm for the survivable network design problem in hypergraphs ⋮ The \(k\)-separator problem: polyhedra, complexity and approximation results
This page was built for publication: The primal-dual method for approximation algorithms
