Abstract
The remarkable discovery of many large-scale real networks is the power-law distribution in degree sequence: the number of vertices with degree i is proportional to i −β for some constant β>1. A lot of researchers believe that it may be easier to solve some optimization problems in power-law graphs. Unfortunately, many problems have been proved NP-hard even in power-law graphs as Ferrante proposed in Ferrante et al. (Theoretical Computer Science 393(1–3):220–230, 2008). Intuitively, a theoretical question is raised: Are these problems on power-law graphs still as hard as on general graphs? The chapter shows that many optimal substructure problems, such as minimum dominating set, minimum vertex cover and maximum independent set, are easier to solve in power-law graphs by illustrating better inapproximability factors. An optimization problem has the property of optimal substructure if its optimal solution on some given graph is essentially the union of the optimal subsolutions on all maximal connected components. In particular, the above problems and a more general problem (ρ-minimum dominating set) are proven to remain APX-hard and their constant inapproximability factors on general power-law graphs by using the cycle-based embedding technique to embed any d-bounded graphs into a power-law graph. In addition, the corresponding inapproximability factors of these problems are further proven in simple power-law graphs based on the graphic embedding technique as well as that of maximum clique and minimum coloring using the embedding technique in Ferrante et al. (Theoretical Computer Science 393 (1–3):220–230, 2008). As a result of these inapproximability factors, the belief that there exists some (1+o(1))-approximation algorithm for these problems on power-law graphs is proven not always true. In addition, this chapter contains the in-depth investigations in the relationship between the exponential factor β and constant greedy approximation algorithms. The last part includes some minor NP-hardness results on simple power-law graphs for small β<1.
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
References
http://vlado.fmf.uni-lj.si/pub/networks/data/erdos/erdos971.net Data of Erdös Collaboration Network in 1997
Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: STOC ’00, pp. 171–180. ACM, New York, NY, USA (2000)
Aiello, W., Chung, F., Lu, L.: A random graph model for power law graphs. Experimental Math 10, 53–66 (2000)
Albert, R., Jeong, H., Barabasi, A.L.: The diameter of the world wide web. Nature 401, 130–131 (1999)
Alimonti, P., Kann, V.: Hardness of approximating problems on cubic graphs. In: CIAC ’97, pp. 288–298. Springer-Verlag, London, UK (1997)
Austrin, P., Khot, S., Safra, M.: Inapproximability of vertex cover and independent set in bounded degree graphs. In: CCC ’09, 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, NY, USA (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 ’04, pp. 718–727. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2004)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, SIGCOMM ’99, pp. 251–262. ACM, New York, NY, USA (1999)
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 ’96, p. 627. IEEE Computer Society, Washington, DC, USA (1996)
Janson, S., Luczak, T., Norros, I.: Large cliques in a power-law random graph (2009)
Kann, V.: On the Approximability of NP-complete Optimization Problems. Ph.D. thesis, Royal Institute of Technology Stockholm (1992)
Kempe, D., Kleinberg, J., 07va Tardos: Influential nodes in a diffusion model for social networks. In: IN ICALP, pp. 1127–1138. Springer Verlag (2005)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: In KDD, pp. 137–146. ACM Press (2003)
Norros, I., Reittu, H.: On a conditionally poissonian graph process. Advances in Applied Probability pp. 38–59 (2006)
Pandurangan, G.: http://www.cs.purdue.edu/homes/gopal/powerlawtalk.pdf (2006)
Redner, S.: How popular is your paper? An empirical study of the citation distribution. The European Physical Journal B - Condensed Matter and Complex Systems 4(2), 131–134 (1998)
Acknowledgements
This work is partially supported by NSF Career Award ♯ 0953284, DTRA; Young Investigator Award, Basic Research Program ♯ HDTRA1-09-1-0061; and DTRA ♯ HDTRA1-08-10.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Shen, Y., Nguyen, D.T., Thai, M.T. (2012). Hardness Complexity of Optimal Substructure Problems on Power-Law Graphs. In: Thai, M., Pardalos, P. (eds) Handbook of Optimization in Complex Networks. Springer Optimization and Its Applications(), vol 57. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-0754-6_10
Download citation
DOI: https://doi.org/10.1007/978-1-4614-0754-6_10
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-0753-9
Online ISBN: 978-1-4614-0754-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)