An improved derandomized approximation algorithm for the max-controlled set problem
Martinhon, Carlos ; Protti, Fábio
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 45 (2011), p. 181-196 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)

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,E 1 ) and G2 = (V,E 2 ) where E 1 ⊆E 2 , the monopoly verification problem (mvp) consists of deciding whether there exists a sandwich graph G = (V,E) (i.e., a graph where E 1 ⊆E⊆E 2 ) 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 1 2 + 1+n 2n-2, where n=|V|>4. (The case n≤4 is solved exactly by considering the parameterized version of the mcsp.) The algorithm is obtained through the use of randomized rounding and derandomization techniques based on the method of conditional expectations. Additionally, we show how to improve this ratio if good estimates of expectation are obtained in advance.

Publié le : 2011-01-01
DOI : https://doi.org/10.1051/ita/2011006
Classification:  68W20,  68W25 
@article{ITA_2011__45_2_181_0,
     author = {Martinhon, Carlos and Protti, F\'abio},
     title = {An improved derandomized approximation algorithm for the max-controlled set problem},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {45},
     year = {2011},
     pages = {181-196},
     doi = {10.1051/ita/2011006},
     mrnumber = {2811653},
     zbl = {1218.68196},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_2011__45_2_181_0}
}

Martinhon, Carlos; Protti, Fábio. An improved derandomized approximation algorithm for the max-controlled set problem. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 45 (2011) pp. 181-196. doi : 10.1051/ita/2011006. http://gdmltest.u-ga.fr/item/ITA_2011__45_2_181_0/

[1] S. Arora and S. Safra, Probabilistic checking of proofs: A new characterization of NP. J. ACM 45 (1998) 70-122. | MR 1614328 | Zbl 0903.68076

[2] J.-C. Bermond and D. Peleg, The power of small coalitions in graphs. Discrete Appl. Math. 127 (2003) 399-414. | MR 1976023 | Zbl 1025.68061

[3] P. Dagum, R. Karp, M. Luby and S. Ross, An optimal algorithm for Monte Carlo estimation. SIAM J. Comput. 29 (2000) 1484-1496. | MR 1744833 | Zbl 1112.65300

[4] R.G. Downey and M.R. Fellows, Fixed parameter tractability and completeness I: Basic results. SIAM J. Comput. 24 (1995) 873-921. | MR 1342997 | Zbl 0830.68063

[5] D. Dubashi and D. Ranjan, Balls and bins: A study of negative dependence. Random Struct. Algorithms 13 (1998) 99-124. | MR 1642566 | Zbl 0964.60503

[6] P. Erdös and J. Spencer, The Probabilistic Method in Combinatorics. Academic Press, San Diego (1974). | Zbl 0853.60004

[7] D. Fitoussi and M. Tennenholtz, Minimal social laws. Proc. AAAI'98 (1998) 26-31. | MR 1653553

[8] R. Gandhi, S. Khuler, S. Parthasarathy and A. Srinivasan, Dependent rounding and its applications to approximation algorithms. J. ACM 53 (2006) 324-360. | MR 2238948

[9] M.C. Golumbic, H. Kaplan and R. Shamir, Graph sandwich problems. J. Algorithms 19 (1994) 449-473. | MR 1355650 | Zbl 0838.68054

[10] H. Kaplan and R. Shamir, Bounded degree interval sandwich problems. Algorithmica 24 (1999) 96-104. | MR 1678023 | Zbl 0934.68070

[11] N. Karmarkar, A new polynomial time algorithm for linear programming. Combinatorica 4 (1984) 375-395. | MR 779900 | Zbl 0557.90065

[12] S. Khot, On the power of unique 2-prover 1-round games, in STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, NY, USA, ACM Press (2002) 767-775. | MR 2121525 | Zbl 1192.68367

[13] N. Linial, D. Peleg, Y. Rabinovich and N. Saks, Sphere packing and local majorities in graphs. Proc. 2nd Israel Symposium on Theoretical Computer Science, IEEE Computer Society Press, Rockville, MD (1993) 141-149.

[14] K. Makino, M. Yamashita and T. Kameda, Max-and min-neighborhood monopolies. Algorithmica 34 (2002) 240-260. | MR 1920301 | Zbl 1016.68057

[15] R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge University Press, London, 1995. | MR 1344451 | Zbl 0849.68039

[16] D. Peleg, Local majority voting, small coalitions and controlling monopolies in graphs: A review. Technical Report CS96-12, Weizmann Institute, Rehovot (1996).

[17] P. Raghavan and C.D. Thompson, Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7 (1987) 365-374. | MR 931194 | Zbl 0651.90052

[18] J.D. Rose, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, in Graph Theory and Computing, edited by R.C. Reed, Academic Press, New York (1972) 183-217. | MR 341833 | Zbl 0266.65028

[19] Y. Shoham and M. Tennenholtz, Emergent conventions in multi-agent systems: Initial experimental results and observations. Proc. International Conference on Principles of Knowledge Representation and Reasoning (1992) 225-231.

[20] Y. Shoham and M. Tennenholtz, On the systhesis of useful social laws for artificial agent societies. Proc. AAAI'92 (1992) 276-281.

[21] S.J. Wright, Primal-Dual Interior-Point Methods. SIAM (1997). | MR 1422257 | Zbl 0863.65031

[22] M. Yannakakis, Computing the minimum fill-in is NP-complete. SIAM J. Algebr. Discrete Methods 2 (1981) 77-79. | MR 604513 | Zbl 0496.68033