Recommendations
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- The dominating set problem in geometric intersection graphs
- Polynomial-time approximation schemes for geometric graphs
- Approximation Algorithms for Geometric Intersection Graphs
- Approximation algorithms for polynomial-expansion and low-density graphs
Cites work
- A linear-time approximation algorithm for the weighted vertex cover problem
- A threshold of ln n for approximating set cover
- Algorithms – ESA 2004
- Almost optimal set covers in finite VC-dimension
- Approximation algorithms for NP-complete problems on planar graphs
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Approximation and Online Algorithms
- Approximation schemes for covering and packing problems in image processing and VLSI
- Better Approximation Schemes for Disk Graphs
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Hitting sets when the VC-dimension is small
- scientific article; zbMATH DE number 3027510 (Why is no real title available?)
- Improved approximation algorithms for geometric set cover
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- On the chromatic number of intersection graphs of convex sets in the plane
- On the complexity of the union of fat convex objects in the plane
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Parameterized Complexity of Independence and Domination on Geometric Graphs
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- Polynomial-time approximation schemes for packing and piercing fat objects
- Separators for sphere-packings and nearest neighbor graphs
- Simple heuristics for unit disk graphs
- Some APX-completeness results for cubic graphs
- The Complexity of Combinatorial Optimization Problems on d‐Dimensional Boxes
- Unit disk graphs
Cited in
(21)- The complexity of dominating set in geometric intersection graphs
- Dominating set of rectangles intersecting a straight line
- On dominating set of some subclasses of string graphs
- A polynomial-time approximation to a minimum dominating set in a graph
- Minimum vertex cover in ball graphs through local search
- Hardness results and approximation schemes for discrete packing and domination problems
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs
- New geometric representations and domination problems on tolerance and multitolerance graphs.
- Approximation algorithms for intersection graphs
- Approximation algorithms for polynomial-expansion and low-density graphs
- Approximation algorithms for intersection graphs
- Approximating dominating set on intersection graphs of rectangles and L-frames
- Algorithms for intersection graphs for \(t\)-intervals and \(t\)-pseudodisks
- The dominating set problem in geometric intersection graphs
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- Geometric dominating-set and set-cover via local-search
- A survey on variant domination problems in geometric intersection graphs
- The algorithm and complexity of co-secure domination in geometric intersection graphs
- Minimum-membership geometric dominating set: complexity and algorithms
- On pseudo-disk hypergraphs
This page was built for publication: Domination in Geometric Intersection Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458576)
