A Fast Approximation Scheme for Low-Dimensional k-Means
V Cohen-Addad - Proceedings of the Twenty-Ninth Annual ACM-SIAM …, 2018 - SIAM
We consider the popular k-means problem in d-dimensional Euclidean space. Recently
Friggstad, Reza-pour, Salavatipour [FOCS'16] and Cohen-Addad, Klein, Mathieu [FOCS'16] …
Friggstad, Reza-pour, Salavatipour [FOCS'16] and Cohen-Addad, Klein, Mathieu [FOCS'16] …
Effectiveness of local search for geometric optimization
V Cohen-Addad, C Mathieu - 31st International Symposium on …, 2015 - drops.dagstuhl.de
What is the effectiveness of local search algorithms for geometric problems in the plane? We
prove that local search with neighborhoods of magnitude 1/epsilon^ c is an approximation …
prove that local search with neighborhoods of magnitude 1/epsilon^ c is an approximation …
The continuous 1.5 D terrain guarding problem: Discretization, optimal solutions, and PTAS
In the NP-hard continuous 1.5 D Terrain Guarding Problem (TGP) we are given an $ x $-
monotone chain of line segments in $\mathbb {R}^ 2$(the terrain $ T $) and ask for the …
monotone chain of line segments in $\mathbb {R}^ 2$(the terrain $ T $) and ask for the …
Packing and covering with non-piercing regions
In this paper, we design the first polynomial time approximation schemes for the Set Cover
and Dominating Set problems when the underlying sets are non-piercing regions (which …
and Dominating Set problems when the underlying sets are non-piercing regions (which …
Exact algorithms for terrain guarding
Given a 1.5-dimensional terrain T, also known as an x-monotone polygonal chain, the
Terrain Guarding problem seeks a set of points of minimum size on T that guards all of the …
Terrain Guarding problem seeks a set of points of minimum size on T that guards all of the …
Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
Abstract A graph G=(V, E) is terrain-like if one can assign a unique integer from the range
[1..| V|] to each vertex in V, such that, if both {i, k} and {j, l} are in E, for any i< j< k< l, then so is …
[1..| V|] to each vertex in V, such that, if both {i, k} and {j, l} are in E, for any i< j< k< l, then so is …
[HTML][HTML] Simple PTAS's for families of graphs excluding a minor
S Cabello, D Gajser - Discrete Applied Mathematics, 2015 - Elsevier
Simple PTAS’s for families of graphs excluding a minor - ScienceDirect Skip to main contentSkip
to article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …
to article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …
On the geometric set multicover problem
Abstract In the Set Multicover problem, we are given a set system (X, S), where X is a finite
ground set, and S is a collection of subsets of X. Each element x∈ X has a non-negative …
ground set, and S is a collection of subsets of X. Each element x∈ X has a non-negative …
On partial covering for geometric set systems
T Inamdar, K Varadarajan - arXiv preprint arXiv:1711.04882, 2017 - arxiv.org
We study a generalization of the Set Cover problem called the\emph {Partial Set Cover} in
the context of geometric set systems. The input to this problem is a set system $(X,\mathcal …
the context of geometric set systems. The input to this problem is a set system $(X,\mathcal …
[PDF][PDF] Packing and covering with non-piercing regions
In this paper, we design the first polynomial time approximation schemes for the Set Cover
and Dominating Set problems when the underlying sets are non-piercing regions (which …
and Dominating Set problems when the underlying sets are non-piercing regions (which …