Skip to main content

and
  1. Article

    Open Access

    Improved Approximations for Guarding 1.5-Dimensional Terrains

    We present a 4-approximation algorithm for the problem of placing the fewest guards on a 1.5D terrain so that every point of the terrain is seen by at least one guard. This improves on the previous best approx...

    Khaled Elbassioni, Erik Krohn, Domagoj Matijević, Julián Mestre in Algorithmica (2011)

  2. No Access

    Article

    On Metric Clustering to Minimize the Sum of Radii

    Given an n-point metric (P,d) and an integer k>0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a randomized algorithm that runs in n ...

    Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani in Algorithmica (2010)