A survey on variant domination problems in geometric intersection graphs

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On connected domination in unit ball graphs
Orthogonal segment stabbing
Minimum connected dominating sets and maximal independent sets in unit disk graphs
A new bound on maximum independent set and minimum connected dominating set in unit disk graphs
A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
APX-hardness of domination problems in circle graphs
Hamiltonian circuits in interval graph generalizations
Unit disk graphs
The complexity of domination problems in circle graphs
Label placement by maximum independent set in rectangles
Unit disk graph recognition is NP-hard
Approximation algorithms for connected dominating sets
On bounding the chromatic number of L-graphs
Dominating set of rectangles intersecting a straight line
On dominating set of some subclasses of string graphs
On grounded \(\llcorner\)-graphs and their relatives
Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames
Efficient sub-5 approximations for minimum dominating sets in unit disk graphs
Independent set of intersection graphs of convex objects in 2D
Improving construction for connected dominating set with Steiner tree in wireless sensor networks
Secure connected domination and secure total domination in unit disk graphs and rectangle graphs
APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS
Edge intersection graphs of single bend paths on a grid
Vertex Intersection Graphs of Paths on a Grid
A threshold of ln n for approximating set cover
On total restrained domination in graphs
Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier
ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Approximation schemes for covering and packing problems in image processing and VLSI
A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
A (2+ε)-Approximation Scheme for Minimum Domination on Circle Graphs
Simple heuristics for unit disk graphs
Polynomial-time approximation schemes for packing and piercing fat objects
Approximation schemes for wireless networks
The Complexity of Combinatorial Optimization Problems on d‐Dimensional Boxes
Domination in Geometric Intersection Graphs
Algorithmic aspects of secure domination in unit disk graphs

This page was built for publication: A survey on variant domination problems in geometric intersection graphs