New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics
The hardness of approximation: gap location
Computational Complexity
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Some optimal inapproximability results
Journal of the ACM (JACM)
Budgeted Maximum Graph Coverage
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Complexity of approximating bounded variants of optimization problems
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Approximating the spanning star forest problem and its applications to genomic sequence alignment
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
We consider new variants of the vertex/edge domination problems on graphs. A vertex is said to dominate itself and its all adjacent vertices, and similarly an edge is said to dominate itself and its all adjacent edges Given an input graph G = (V, E) and an integer k, the k-Vertex (k-Edge) Maximum Domination (k-MaxVD and k-MaxED, respectively) is to find a subset DV ⊆ V of vertices (resp. DE ⊆ E of edges) with size at most k that maximizes the cardinality of dominated vertices (resp., edges). In this paper, we first show that a simple greedy strategy achieves an approximation ratio of (1−1/e) for both k-MaxVD and k-MaxED. Then, we show that this approximation ratio is the best possible for k-MaxVD unless P = NP. We also prove that, for any constant ε 0, there is no polynomial time 1303/1304+ε approximation algorithm for k-MaxED unless P = NP. However, if k is not larger than the size of the minimum maximal matching, k-MaxED is 3/4-approximable in polynomial time.