Approximation and Online Algorithms
From MaRDI portal
Publication:5896928
DOI10.1007/b95598zbMath1173.68588OpenAlexW4300520713MaRDI QIDQ5896928
Publication date: 11 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95598
Combinatorics in computer science (68R05) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (12)
A note on the minimum power partial cover problem on the plane ⋮ Fault-tolerant covering problems in metric spaces ⋮ Minimum power partial multi-cover on a line ⋮ Approximation algorithms for the minimum power cover problem with submodular/linear penalties ⋮ The bound coverage problem by aligned disks in \(L_1\) metric ⋮ An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem ⋮ An approximation algorithm for the \(H\)-prize-collecting power cover problem ⋮ A PTAS for the disk cover problem of geometric objects ⋮ Towards flexible demands in online leasing problems ⋮ Multi Cover of a Polygon Minimizing the Sum of Areas ⋮ Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks ⋮ A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
This page was built for publication: Approximation and Online Algorithms
