Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking

@article{Pilipczuk2017ApproximationAP,
  title={Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking},
  author={Michal Pilipczuk and E. J. V. Leeuwen and A. Wiese},
  journal={ArXiv},
  year={2017},
  volume={abs/1611.06501}
}
Consider the Maximum Weight Independent Set problem for rectangles: given a family of weighted axis-parallel rectangles in the plane, find a maximum-weight subset of non-overlapping rectangles. The problem is notoriously hard both in the approximation and in the parameterized setting. The best known polynomial-time approximation algorithms achieve super-constant approximation ratios [Chalermsook & Chuzhoy, Proc. SODA 2009; Chan & Har-Peled, Discrete & Comp. Geometry, 2012], even though there is… Expand
2 Citations
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
  • 6
  • PDF

References

SHOWING 1-10 OF 39 REFERENCES
On Approximating Maximum Independent Set of Rectangles
  • Julia Chuzhoy, A. Ene
  • Mathematics, Computer Science
  • 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2016
  • 22
  • PDF
Approximation Schemes for Maximum Weight Independent Set of Rectangles
  • A. Adamaszek, A. Wiese
  • Mathematics, Computer Science
  • 2013 IEEE 54th Annual Symposium on Foundations of Computer Science
  • 2013
  • 81
  • PDF
A note on maximum independent sets in rectangle intersection graphs
  • 50
  • PDF
Maximum independent set of rectangles
  • 97
  • PDF
Independent Set of Convex Polygons: From nϵ to 1+ϵ via Shrinking
  • A. Wiese
  • Mathematics, Computer Science
  • LATIN
  • 2016
  • 2
  • PDF
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks
  • 33
  • PDF
Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons
  • Sariel Har-Peled
  • Computer Science, Mathematics
  • Symposium on Computational Geometry
  • 2014
  • 39
  • PDF
...
1
2
3
4
...