2004 | OriginalPaper | Chapter
An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem
Authors : Carlos A. Martinhon, Fábio Protti
Published in: Experimental and Efficient Algorithms
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
A vertex i of a graph G=(V,E) is said to be controlled by M ⊆ V if the majority of the elements of the neighborhood of i (including itself) belong to M. The set M is a monopoly in G if every vertex i ∈ V is controlled by M. Given a set M ⊆ V and two graphs G1=(V,E1) and G2=(V,E2) where E1 ⊆ E2, the monopoly verification problem (mvp) consists of deciding whether there exists a sandwich graph G=(V,E) (i.e., a graph where E1 ⊆ E ⊆ E2) such that M is a monopoly in G=(V,E). If the answer to the mvp is No, we then consider the max-controlled set problem (mcsp), whose objective is to find a sandwich graph G=(V,E) such that the number of vertices of G controlled by M is maximized. The mvp can be solved in polynomial time; the mcsp, however, is NP-hard. In this work, we present a deterministic polynomial time approximation algorithm for the mcsp with ratio $\frac{1}{2}+ \frac{1+\sqrt{n}}{2n-2}$, where n=|V|>4. (The case n ≤ 4 is solved exactly by considering the parameterized version of the mcsp.) The algoritm is obtained through the use of randomized rounding and derandomization techniques, namely the method of conditional expectations. Additionally, we show how to improve this ratio if good estimates of expectation are obtained in advance.