Improved approximation algorithms for geometric set cover
From MaRDI portal
Recommendations
- Improved approximation algorithms for geometric set cover
- Faster approximation algorithms for geometric set cover
- Approximation algorithms for a geometric set cover problem
- Exact and approximation algorithms for geometric and capacitated set cover problems
- Exact and approximation algorithms for geometric and capacitated set cover problems
- An exact algorithm for a class of geometric set-cover problems
- scientific article; zbMATH DE number 2081015
- Near-linear algorithms for geometric hitting sets and set covers
- Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
- scientific article; zbMATH DE number 7378687
Cited in
(87)- Minimum-membership geometric set cover, revisited
- Near-linear approximation algorithms for geometric hitting sets
- On the set multicover problem in geometric settings
- Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs
- On guarding orthogonal polygons with sliding cameras
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
- Covering problem on fuzzy graphs and its application in disaster management system
- Algorithms for covering multiple submodular constraints and applications
- One-sided discrete terrain guarding and chordal graphs
- Helly-type theorems for approximate covering
- On partial covering for geometric set systems
- Small strong epsilon nets
- A note about weak -nets for axis-parallel boxes in d-space
- The parameterized complexity of stabbing rectangles
- An improved approximation algorithm for the most points covering problem
- Altitude terrain guarding and guarding uni-monotone polygons
- Finding, hitting and packing cycles in subexponential time on unit disk graphs
- Improved results on geometric hitting set problems
- Covering polygons with rectangles
- Approximation algorithms for polynomial-expansion and low-density graphs
- An algorithmic framework for solving geometric covering problems -- with applications
- Guarding 1.5D terrains with demands
- Approximation algorithms for art gallery problems in polygons
- Improved approximation algorithms for geometric set cover
- A fixed-parameter algorithm for guarding 1.5D terrains
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
- On the union complexity of families of axis-parallel rectangles with a low packing number
- Near-linear time approximation schemes for geometric maximum coverage
- Constrained hitting set problem with intervals
- Guarding orthogonal art galleries with sliding k-transmitters: hardness and approximation
- Weighted geometric set cover problems revisited
- Parameter analysis for guarding terrains
- TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS
- An improved line-separable algorithm for discrete unit disk cover
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
- Approximation algorithms for maximum independent set of pseudo-disks
- Almost optimal set covers in finite VC-dimension
- Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
- Survey of quantitative methods in construction
- Improved Local Computation Algorithm for Set Cover via Sparsification
- Hitting sets online and unique-MAX coloring
- More dynamic data structures for geometric set cover with sublinear update time
- A non-linear lower bound for planar epsilon-nets
- Constant-factor approximation for TSP with disks
- Clustering geometrically-modeled points in the aggregated uncertainty model
- Faster approximation algorithms for geometric set cover
- Exact algorithms and APX-hardness results for geometric packing and covering problems
- Linear Time Approximation Schemes for Geometric Maximum Coverage
- The class cover problem with boxes
- Approximation algorithms for a geometric set cover problem
- On the geometric set multicover problem
- The \(\varepsilon\)-\(t\)-net problem
- Guarding a terrain by two watchtowers
- Domination in Geometric Intersection Graphs
- A PTAS for the Weighted Unit Disk Cover Problem
- Parameterized complexity of geometric covering problems having conflicts
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
- Helly-type theorems for approximate covering
- On the approximability of covering points by lines and related problems
- Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms
- One-sided terrain guarding and chordal graphs
- On Geometric Set Cover for Orthants
- Geometric dominating-set and set-cover via local-search
- Capacitated covering problems in geometric spaces
- A finite dominating set of cardinality \(O(k)\) and a witness set of cardinality \(O(n)\) for 1.5D terrain guarding problem
- Parameterized Analysis of Art Gallery and Terrain Guarding
- scientific article; zbMATH DE number 7236415 (Why is no real title available?)
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
- 1.5D terrain guarding problem parameterized by guard range
- On the discrete and semi-continuous versions of the two-watchtower problem in the plane
- Stabbing Convex Polygons with a Segment or a Polygon
- Geometric covering via extraction theorem
- Near-linear algorithms for geometric hitting sets and set covers
- Capacitated covering problems in geometric spaces
- The number of holes in the union of translates of a convex set in three dimensions
- Approximately dominating representatives
- Tight lower bounds for the size of epsilon-nets
- Exact and approximation algorithms for geometric and capacitated set cover problems
- A PTAS for the cardinality constrained covering with unit balls
- Small candidate set for translational pattern search
- Dynamic geometric set cover, revisited
- Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
- Generalized class cover problem with axis-parallel strips
- Improved algorithms for minimum-membership geometric set cover
- On the set multi-cover problem in geometric settings
- Near-optimal lower bounds for -nets for half-spaces and low complexity set systems
- The within-strip discrete unit disk cover problem
This page was built for publication: Improved approximation algorithms for geometric set cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866970)
