scientific article
From MaRDI portal
Publication:2768362
zbMath0988.65020MaRDI QIDQ2768362
Eike Seidel, Erlebach, Thomas, Klaus Jansen
Publication date: 22 July 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
dynamic programmingintersection graphdisk graphminimum weight vertex cover problemrecursive subdivisionpolynomial-time approximation schemesdisklike geometric objects
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
A Basic Parameterized Complexity Primer ⋮ Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs ⋮ Approximate strong separation with application in fractional graph coloring and preemptive scheduling. ⋮ Winner determination in geometrical combinatorial auctions ⋮ Theory and application of width bounded geometric separators ⋮ Minimum clique partition in unit disk graphs ⋮ Independent set of intersection graphs of convex objects in 2D ⋮ Coloring and Maximum Independent Set of Rectangles ⋮ A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation ⋮ A note on maximum independent sets in rectangle intersection graphs ⋮ Unnamed Item ⋮ On-line coloring of geometric intersection graphs
