APX-hardness of domination problems in circle graphs
نویسندگان
چکیده
We show that the problem of finding a minimum dominating set in a circle graph is APXhard: there is a constant δ > 0 such that there is no (1 + δ)-approximation algorithm for the minimum dominating set problem on circle graphs unless P = NP. Hence a PTAS for this problem seems unlikely. This hardness result complements the (2 + ε)-approximation algorithm for the problem (Journal of Algorithms, 42(2), 255-276, 2002).
منابع مشابه
Domination in Geometric Intersection Graphs
For intersection graphs of disks and other fat objects, polynomial-time approximation schemes are known for the independent set and vertex cover problems, but the existing techniques were not able to deal with the dominating set problem except in the special case of unit-size objects. We present approximation algorithms and inapproximability results that shed new light on the approximability of...
متن کاملComplexity and approximation ratio of semitotal domination in graphs
A set $S subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating set of $G$ andevery vertex in $S$ is within distance 2 of another vertex of $S$. Thesemitotal domination number $gamma_{t2}(G)$ is the minimumcardinality of a semitotal dominating set of $G$.We show that the semitotal domination problem isAPX-complete for bounded-degree graphs, and the semitotal dominatio...
متن کاملApproximation hardness of optimization problems in intersection graphs of d-dimensional boxes
The Maximum Independent Set problem in d-box graphs, i.e., in the intersection graphs of axis-parallel rectangles in Rd, is a challenge open problem. For any fixed d ≥ 2 the problem is NP-hard and no approximation algorithm with ratio o(logd−1 n) is known. In some restricted cases, e.g., for d-boxes with bounded aspect ratio, a PTAS exists [17]. In this paper we prove APX-hardness (and hence no...
متن کاملNew Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain amount of overlap without being in conflict. In one of the most natural generalizations of tolerance graphs with direct applications in the comparison of DNA sequences from different organisms, namely multitolerance graphs, two tolerances are allowed for each interval – one from the left and one from t...
متن کاملAlgorithm and Hardness Results for Outer-connected Dominating Set in Graphs
A set D ⊆ V of a graph G = (V,E) is called an outer-connected dominating set of G if for all v ∈ V , |NG[v] ∩ D| ≥ 1, and the induced subgraph of G on V \D is connected. The Minimum Outer-connected Domination problem is to find an outer-connected dominating set of minimum cardinality of the input graph G. Given a positive integer k and a graph G = (V,E), the Outer-connected Domination Decision ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 97 شماره
صفحات -
تاریخ انتشار 2006