Near-Linear Algorithms for Geometric Hitting Sets and Set Covers

Given a finite range space Σ = ( X , R ) , with N = | X | + | R | , we present two simple algorithms, based on the multiplicative-weight method, for computing a small-size hitting set or set cover of Σ . The first algorithm is a simpler variant of the Brönnimann–Goodrich algorithm but more efficient...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete & computational geometry Vol. 63; no. 2; pp. 460 - 482
Main Authors:	Agarwal, Pankaj K., Pan, Jiangwei
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.03.2020 Springer Nature B.V
Subjects:	Algorithms Combinatorics Computation Computational Mathematics and Numerical Analysis Data structures Disks Mathematics Mathematics and Statistics Zero sum games Rectangles Multiplicative weight method Disks Geometric set cover Near-linear algorithms 68U05 52C17
ISSN:	0179-5376, 1432-0444
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!