Approximating dominating set on intersection graphs of rectangles and L-frames
From MaRDI portal
Recommendations
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames
- Dominating set of rectangles intersecting a straight line
- Domination in Geometric Intersection Graphs
- On dominating set of some subclasses of string graphs
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
Cites work
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- A (2+ε)-Approximation Scheme for Minimum Domination on Circle Graphs
- APX-hardness of domination problems in circle graphs
- Algorithms for dominating set in disk graphs: breaking the \(\log n\) barrier (extended abstract)
- An algorithm for the maximum weight independent set problem on outerstring graphs
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
- Analytical approach to parallel repetition
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames
- Approximating domination on intersection graphs of paths on a grid
- Approximation algorithms for maximum independent set of pseudo-disks
- Covering, hitting, piercing and packing rectangles intersecting an inclined line
- Domination in Geometric Intersection Graphs
- Edge intersection graphs of single bend paths on a grid
- Edge-intersection graphs of grid paths: the bend-number
- Improved results on geometric hitting set problems
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
- Max point-tolerance graphs
- Minimum Edge Dominating Sets
- On the hardness of approximating minimum vertex cover
- Optimal binary space partitions for segments in the plane
- Optimization problems in multiple-interval graphs
- Packing and covering with non-piercing regions
- Parameterized Complexity of Independence and Domination on Geometric Graphs
- The hardness of approximation of Euclidean k-means
- Vertex Intersection Graphs of Paths on a Grid
Cited in
(4)
This page was built for publication: Approximating dominating set on intersection graphs of rectangles and L-frames
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005138)
