For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k...
Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin...
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...