One for the price of two: a unified approach for approximating covering problems
From MaRDI portal
Publication:1977131
DOI10.1007/s004530010009zbMath0951.68177OpenAlexW2179980496MaRDI QIDQ1977131
Publication date: 9 May 2000
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004530010009
Related Items (21)
Flexible bandwidth assignment with application to optical networks ⋮ Efficient approximation of convex recolorings ⋮ Using fractional primal-dual to schedule split intervals with demands ⋮ Approximating activation edge-cover and facility location problems ⋮ A novel parameterised approximation algorithm for \textsc{minimum vertex cover} ⋮ Parameterized approximation via fidelity preserving transformations ⋮ Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost ⋮ Exploiting locality: Approximating sorting buffers ⋮ Improved approximation algorithm for convex recoloring of trees ⋮ Bounding the payment of approximate truthful mechanisms ⋮ Approximating the 2-interval pattern problem ⋮ Admission control with advance reservations in simple networks ⋮ The minimum substring cover problem ⋮ Elementary approximation algorithms for prize collecting Steiner tree problems ⋮ Local ratio with negative weights. ⋮ Unnamed Item ⋮ The Minimum Substring Cover Problem ⋮ A note on Rooted Survivable Networks ⋮ Resource allocation in bounded degree trees ⋮ A new approach for approximating node deletion problems ⋮ Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This page was built for publication: One for the price of two: a unified approach for approximating covering problems
