Polynomial-time approximation schemes for geometric graphs
From MaRDI portal
Recommendations
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- Approximation Algorithms for Geometric Intersection Graphs
- Better Approximation Schemes for Disk Graphs
- Graph-Theoretic Concepts in Computer Science
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs
Cited in
(33)- A note on maximum independent sets in rectangle intersection graphs
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
- Winner determination in geometrical combinatorial auctions
- On-line coloring of geometric intersection graphs
- A PTAS for the disk cover problem of geometric objects
- Independent set of intersection graphs of convex objects in 2D
- A basic parameterized complexity primer
- 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
- scientific article; zbMATH DE number 437554 (Why is no real title available?)
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- On the polytope faces of the graph approximation problem
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
- Approximation Algorithms for Geometric Intersection Graphs
- Shifting strategy for geometric graphs without geometry
- Efficient Algorithms for Geometric Graph Search Problems
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- scientific article; zbMATH DE number 2081090 (Why is no real title available?)
- Shifting strategy for geometric graphs without geometry
- Approximation algorithms for polynomial-expansion and low-density graphs
- QPTAS and subexponential algorithm for maximum clique on disk graphs
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- Domination in Geometric Intersection Graphs
- Algorithms – ESA 2005
- scientific article; zbMATH DE number 2230206 (Why is no real title available?)
- Graph-Theoretic Concepts in Computer Science
- Better Approximation Schemes for Disk Graphs
- Theory and application of width bounded geometric separators
- PTAS for minimum cost multicovering with disks
- Minimum clique partition in unit disk graphs
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- Minimum cuts in geometric intersection graphs
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
This page was built for publication: Polynomial-time approximation schemes for geometric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768362)
