Algorithms – ESA 2005

DOI10.1007/11561071zbMath1162.68735OpenAlexW2501059503MaRDI QIDQ5475856

Panagiotis Kanellopoulos, Christos Kaklamanis, Ioannis Caragiannis, Vittorio Bilò

Publication date: 27 June 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11561071

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (28)

A mixed breadth-depth first strategy for the branch and bound tree of Euclidean \(k\)-center problems ⋮ 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 ⋮ Geometric hitting set for line-constrained disks ⋮ A 2-phase approach for planning of hazardous waste collection using an unmanned aerial vehicle ⋮ An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem ⋮ An approximation algorithm for the \(H\)-prize-collecting power cover problem ⋮ Energy-constrained geometric coverage problem ⋮ Covering moving points with anchored disks ⋮ On Metric Clustering to Minimize the Sum of Radii ⋮ Connecting a set of circles with minimum sum of radii ⋮ Radar placement along banks of river ⋮ Shifting strategy for geometric graphs without geometry ⋮ A PTAS for the disk cover problem of geometric objects ⋮ Locating Facilities on a Network to Minimize Their Average Service Radius ⋮ Online sum-radii clustering ⋮ Algorithms for the line-constrained disk coverage and related problems ⋮ Parallel approximation for partial set cover ⋮ Anchored rectangle and square packings ⋮ Algorithms for the line-constrained disk coverage and related problems ⋮ On metric clustering to minimize the sum of radii ⋮ Multi Cover of a Polygon Minimizing the Sum of Areas ⋮ Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks ⋮ Unnamed Item ⋮ A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem ⋮ Average case network lifetime on an interval with adjustable sensing ranges

This page was built for publication: Algorithms – ESA 2005