NDLI: Epsilon nets and union complexity

Please wait, while we are loading the content...

Lower bounds for weak epsilon-nets and stair-convexity

Coresets for polytope distance

Computing hereditary convex structures

An IP solution to the art gallery problem

The scale axis transform

An improved bound on the number of unit area triangles

Visibility maps of realistic terrains have linear smoothed complexity

Divide-and-conquer for Voronoi diagrams revisited

Persistent cohomology and circular coordinates

Distributed vision with smart pixels

A proof of the molecular conjecture

k-means requires exponentially many iterations even in the plane

Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach

Diameter of polyhedra: limits of abstraction

Computational origami: from flapping birds to space telescopes

Epsilon nets and union complexity

Kinetic spanners in $R^{d}$

Binary plane partitions for disjoint line segments

Quadrilateral meshes with bounded minimum angle

Integral estimation from point cloud in d-dimensional space: a geometric view

Halving lines and measure concentration in the plane

Embedding rivers in polyhedral terrains

The geodesic farthest-site Voronoi diagram in a polygonal domain with holes

Proximity of persistence modules and their diagrams

Area-universal rectangular layouts

Flattening single-vertex origami: the non-expansive case

Approximation algorithms for maximum independent set of pseudo-disks

On the topology of planar algebraic curves

Minimum Manhattan network is NP-complete

PTAS for geometric hitting set problems via local search

Shooting permanent rays among disjoint polygons in the plane

Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection

Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions)

Cut locus and topology from surface point data

Candle in the woods: asymptotic bounds on minimum blocking sets

The Euclidean degree-4 minimum spanning tree problem is NP-hard

Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension

Zigzag persistent homology and real-valued functions

Cache-oblivious range reporting with optimal queries requires superlinear space

Arrangements of double pseudolines: extended abstract

On the set multi-cover problem in geometric settings

Randomly removing g handles at once

On grids in topological graphs

Near-linear approximation algorithms for geometric hitting sets

The scale axis picture show

Approximate center points with proofs

Parallel geometric algorithms for multi-core computers

A general approach for cache-oblivious range reporting and approximate range counting

Minimum cuts and shortest homologous cycles

Rectangular cartograms: the game

Geometric tomography: a limited-view approach for computed tomography

Straight skeletons of three-dimensional polyhedra

Reconstructing sharp features of triangular meshes

High resolution surface reconstruction from overlapping multiple-views

Epsilon nets and union complexity

Content Provider	ACM Digital Library
Author	Varadarajan, Kasturi
Abstract	We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest subset of these n objects that covers all points that are in at least L of the objects? This is the classic question about the size of an L/n-net for these objects. It is well known that for fairly general classes of geometric objects the size of an L/n-net is O(n/L log n/L). There are some instances where this general bound can be improved, and this improvement is usually due to bounds on the combinatorial complexity (size) of the boundary of the union of these objects. Thus, the boundary of the union of m disks has size O(m), and this translates to an O(n/L) bound on the size of an L/n-net for disks. For m fat triangles, the size of the union boundary is O(m log log m), and this yields L/n-nets of size O(n/L log log n/L). Improved nets directly translate into an upper bound on the ratio between the optimal integral solution and the optimal fractional solution for the corresponding geometric set cover problem. Thus, for covering k points by disks, this ratio is O(1); and for covering k points by fat triangles, this ratio is O(log log k). This connection to approximation algorithms for geometric set cover is a major motivation for attempting to improve bounds on nets. Our main result is an argument that in some cases yields nets that are smaller than those previously obtained from the size of the union boundary. Thus for fat triangles, for instance, we obtain nets of size O(n/L log log log n). We use this to obtain a randomized polynomial time algorithm that gives an O(log log log k)-approximation for the problem of covering k points by the smallest subset of a given set of triangles.
Starting Page	11
Ending Page	16
Page Count	6
File Format	PDF
ISBN	9781605585017
DOI	10.1145/1542362.1542366
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2009-06-08
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Epsilon nets Set cover Approximation algorithms
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Weighted geometric set cover via quasi-uniform sampling

Epsilon nets and union complexity (2009)

A Non-linear Lower Bound for Planar Epsilon-Nets

Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search

Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes

Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems

Improved approximation algorithms for geometric set cover

Covering Problems with Hard Capacities

Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem

Epsilon nets and union complexity

Similar Documents

Weighted geometric set cover via quasi-uniform sampling

Epsilon nets and union complexity (2009)

A Non-linear Lower Bound for Planar Epsilon-Nets

Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search

Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes

Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems

Improved approximation algorithms for geometric set cover

Covering Problems with Hard Capacities

Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem

Epsilon nets and union complexity