Weighted geometric set cover via quasi-uniform sampling
From MaRDI portal
Publication:2875191
Recommendations
- Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
- Weighted geometric set multi-cover via quasi-uniform sampling
- Weighted geometric set multi-cover via quasi-uniform sampling
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
- Weighted geometric set cover problems revisited
Cited in
(47)- Weighted geometric set multi-cover via quasi-uniform sampling
- Tighter estimates for -nets for disks
- Algorithms for covering multiple submodular constraints and applications
- On partial covering for geometric set systems
- Geometric Packing under Nonuniform Constraints
- Improved results on geometric hitting set problems
- scientific article; zbMATH DE number 7378687 (Why is no real title available?)
- Packing and covering with non-piercing regions
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
- Polychromatic colorings of unions of geometric hypergraphs
- Near-linear time approximation schemes for geometric maximum coverage
- scientific article; zbMATH DE number 7561579 (Why is no real title available?)
- On the geometric priority set cover problem
- Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions.
- Weighted geometric set cover with rectangles of bounded integer side lengths
- PTAS for minimum cost multicovering with disks
- Approximation algorithms for maximum independent set of pseudo-disks
- Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
- Octants are cover-decomposable
- A PTAS for the horizontal rectangle stabbing problem
- Hypergraph representation via axis-aligned point-subspace cover
- Exact algorithms and APX-hardness results for geometric packing and covering problems
- Linear Time Approximation Schemes for Geometric Maximum Coverage
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
- Weighted geometric set multi-cover via quasi-uniform sampling
- A PTAS for the horizontal rectangle stabbing problem
- On the geometric set multicover problem
- Constructing planar support for non-piercing regions
- A PTAS for the Weighted Unit Disk Cover Problem
- Fair scheduling via iterative quasi-uniform sampling
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- On capacitated set cover problems
- scientific article; zbMATH DE number 7561580 (Why is no real title available?)
- On Geometric Set Cover for Orthants
- Geometric dominating-set and set-cover via local-search
- Capacitated covering problems in geometric spaces
- Constant factor approximation algorithm for weighted flow-time on a single machine in pseudopolynomial time
- Minimum power partial multi-cover on a line
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
- Planar Support for Non-piercing Regions and Applications
- Capacitated covering problems in geometric spaces
- When are epsilon-nets small?
- A primal-dual algorithm for the minimum power partial cover problem
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time
- Octants are cover-decomposable into many coverings
- Geometric stabbing via threshold rounding and factor revealing LPs
- Near-optimal lower bounds for \(\epsilon\)-nets for half-spaces and low complexity set systems
This page was built for publication: Weighted geometric set cover via quasi-uniform sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875191)
