Abstract
The discovery of power law distribution in degree sequence (i.e. the number of vertices with degree i is proportional to i − β for some constant β) of many large-scale real networks creates a belief that it may be easier to solve many optimization problems in such networks. Our works focus on the hardness and inapproximability of optimization problems on power law graphs (PLG). In this paper, we show that the Minimum Dominating Set, Minimum Vertex Cover and Maximum Independent Set are still APX-hard on power law graphs. We further show the inapproximability factors of these optimization problems and a more general problem (ρ-Minimum Dominating Set), which proved that a belief of (1 + o(1))-approximation algorithm for these problems on power law graphs is not always true. In order to show the above theoretical results, we propose a general cycle-based embedding technique to embed any d-bounded graphs into a power law graph. In addition, we present a brief description of the relationship between the exponential factor β and constant greedy approximation algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: STOC 2000, pp. 171–180. ACM, New York (2000)
Aiello, W., Chung, F., Lu, L.: A random graph model for power law graphs. Experimental Math. 10, 53–66 (2000)
Alimonti, P., Kann, V.: Hardness of approximating problems on cubic graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol. 1203, pp. 288–298. Springer, Heidelberg (1997)
Austrin, P., Khot, S., Safra, M.: Inapproximability of vertex cover and independent set in bounded degree graphs. In: CCC 2009, pp. 74–80 (2009)
Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Bianconi, G., Barabási, A.L.: Bose-einstein condensation in complex networks (2000)
Bondy, J., Murty, U.: Graph theory with applications. MacMillan, London (1976)
Bornholdt, S., Schuster, H.G. (eds.): Handbook of Graphs and Networks: From the Genome to the Internet. John Wiley & Sons, Inc., New York (2003)
Chlebík, M., Chlebíková, J.: Approximation hardness of dominating set problems in bounded degree graphs. Inf. Comput. 206(11), 1264–1275 (2008)
Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics 162, 2005 (2004)
Erdos, P., Gallai, T.: Graphs with prescribed degrees of vertices. Mat. Lapok 11, 264–274 (1960)
Eubank, S., Kumar, V.S.A., Marathe, M.V., Srinivasan, A., Wang, N.: Structural and algorithmic aspects of massive social networks. In: SODA 2004, pp. 718–727. Society for Industrial and Applied Mathematics, Philadelphia (2004)
Ferrante, A., Pandurangan, G., Park, K.: On the hardness of optimization in power-law graphs. Theoretical Computer Science 393(1-3), 220–230 (2008)
Gkantsidis, C., Mihail, M., Saberi, A.: Conductance and congestion in power law graphs. SIGMETRICS Perform. Eval. Rev. 31(1), 148–159 (2003)
Hastad, J.: Clique is hard to approximate within n 1 − ε. In: FOCS 1996, Washington, DC, USA, p. 627. IEEE Computer Society, Los Alamitos (1996)
Janson, S., Luczak, T., Norros, I.: Large cliques in a power-law random graph (2009)
Kempe, D., Kleinberg, J., Tardos, É.: Influential nodes in a diffusion model for social networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127–1138. Springer, Heidelberg (2005)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: KDD, pp. 137–146. ACM Press, New York (2003)
Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: 32nd STOC, pp. 163–170 (2000)
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic models for the web graph. In: FOCS 2000, p. 57 (2000)
Norros, I., Reittu, H.: On a conditionally poissonian graph process. In: Advances in Applied Probability, pp. 38–59 (2006)
Pandurangan, G., http://www.cs.purdue.edu/homes/gopal/powerlawtalk.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shen, Y., Nguyen, D.T., Thai, M.T. (2010). On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17458-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-17458-2_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17457-5
Online ISBN: 978-3-642-17458-2
eBook Packages: Computer ScienceComputer Science (R0)