Weighted geometric set multi-cover via quasi-uniform sampling

DOI10.20382/JOCG.V7I1A11zbMATH Open1405.68396OpenAlexW2416034390MaRDI QIDQ2970451FDOQ2970451

Authors: N. Bansal, Kirk Pruhs 

Publication date: 30 March 2017

Full work available at URL: https://doi.org/10.20382/jocg.v7i1a11

Recommendations

• Weighted geometric set multi-cover via quasi-uniform sampling
• Weighted geometric set cover via quasi-uniform sampling
• Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
• Weighted geometric set cover problems revisited
• Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
• Weighted geometric set cover with rectangles of bounded integer side lengths
• A generalization of the weighted set covering problem
• On the set multi-cover problem in geometric settings
• On the set multicover problem in geometric settings
• On the geometric set multicover problem

Mathematics Subject Classification ID

Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cited In (14)

• Weighted geometric set multi-cover via quasi-uniform sampling
• Title not available (Why is that?)
• On the geometric priority set cover problem
• Weighted geometric set cover problems revisited
• Weighted geometric set cover with rectangles of bounded integer side lengths
• Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
• Exact and approximation algorithms for geometric and capacitated set cover problems
• Local search strikes again: PTAS for variants of geometric covering and packing
• On the geometric set multicover problem
• Weighted geometric set cover via quasi-uniform sampling
• Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
• Approximation algorithms for highly connected multi-dominating sets in unit disk graphs
• Geometric stabbing via threshold rounding and factor revealing LPs
• On the set multi-cover problem in geometric settings

This page was built for publication: Weighted geometric set multi-cover via quasi-uniform sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970451)