Approximation Algorithms for Maximum Independent Set of Pseudo-Disks
- 7 March 2012
- journal article
- Published by Springer Science and Business Media LLC in Discrete & Computational Geometry
- Vol. 48 (2), 373-392
- https://doi.org/10.1007/s00454-012-9417-5
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- State of the union (of geometric objects)Contemporary Mathematics, 2008
- Independent set of intersection graphs of convex objects in 2DComputational Geometry, 2006
- Dynamic Connectivity for Axis-Parallel RectanglesLecture Notes in Computer Science, 2006
- Local ratioACM Computing Surveys, 2004
- The Probabilistic MethodPublished by Wiley ,2000
- Label placement by maximum independent set in rectanglesComputational Geometry, 1998
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJournal of the ACM, 1998
- On Levels in Arrangements of Lines, Segments, Planes, and Triangles%Discrete & Computational Geometry, 1998
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- On a Coloring Problem.MATHEMATICA SCANDINAVICA, 1960