A (2+ε)-Approximation Scheme for Minimum Domination on Circle Graphs
From MaRDI portal
Publication:4538081
DOI10.1006/jagm.2001.1206zbMath1002.05066OpenAlexW3137843283MaRDI QIDQ4538081
Mirela Damian-Iordache, Sriram V. Pemmaraju
Publication date: 11 July 2002
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2001.1206
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
On dominating set of some subclasses of string graphs ⋮ Linear-time algorithm for paired-domination on distance-hereditary graphs ⋮ Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames ⋮ APX-hardness of domination problems in circle graphs ⋮ Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames
This page was built for publication: A (2+ε)-Approximation Scheme for Minimum Domination on Circle Graphs
