{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:47:31Z","timestamp":1725490051755},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735441"},{"type":"electronic","value":"9783540735458"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_41","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T13:44:11Z","timestamp":1187358251000},"page":"417-427","source":"Crossref","is-referenced-by-count":1,"title":["On the Hardness of Optimization in Power Law Graphs"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Ferrante","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gopal","family":"Pandurangan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kihong","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","first-page":"171","volume-title":"Proceedings of STOC 2000","author":"W. Aiello","year":"2000","unstructured":"Aiello, W., Chung, F.R.K., Lu, L.: A Random Graph Model for Massive Graphs. In: Proceedings of STOC 2000, pp. 171\u2013180. ACM Press, New York (2000)"},{"key":"41_CR2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1080\/10586458.2001.10504428","volume":"10","author":"W. Aiello","year":"2000","unstructured":"Aiello, W., Chung, F.R.K., Lu, L.: A random graph model for power law graphs. In Experimental Mathematics\u00a010, 53\u201366 (2000)","journal-title":"In Experimental Mathematics"},{"key":"41_CR3","volume-title":"Handbook of Graphs and Networks","author":"A. Barabasi","year":"2003","unstructured":"Barabasi, A.: Emergence of Scaling in Complex Networks. In: Bornholdt, S., Schuster, H. (eds.) Handbook of Graphs and Networks, Wiley, Chichester (2003)"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Bollobas, B., Riordan, O.: Mathematical Results on Scale-free Random Graphs. In: Bornholdt, S., Schuster, H. (eds.) Handbook of Graphs and Networks (2003)","DOI":"10.1002\/3527602755.ch1"},{"key":"41_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, Amsterdam (1976)"},{"key":"41_CR6","first-page":"711","volume-title":"SODA 2004","author":"S. Eubank","year":"2004","unstructured":"Eubank, S., Kumar, V.S.A., Marathe, M.V., Srinivasan, A., Wang, N.: Structural and Algorithmic Aspects of Massive Social Networks. In: SODA 2004. Proceedings of 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 711\u2013720. ACM Press, New York (2004)"},{"key":"41_CR7","unstructured":"Ferrante, A., Pandurangan, G., Park, K.: On the Hardness of Optimization in Power-Law Graphs, http:\/\/www.cs.purdue.edu\/homes\/gopal\/papers-by-date.html"},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1145\/781027.781046","volume-title":"Proceedings of SIGMETRICS 2003","author":"C. Gkantsidis","year":"2003","unstructured":"Gkantsidis, C., Mihail, M., Saberi, A.: Throughput and Congestion in Power-Law Graphs. In: Proceedings of SIGMETRICS 2003, pp. 148\u2013159. ACM Press, New York (2003)"},{"key":"41_CR9","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/11732990_4","volume-title":"Research in Computational Molecular Biology","author":"M. Koyuturk","year":"2006","unstructured":"Koyuturk, M., Grama, A., Szpankowski, W.: Assessing significance of connectivity and conservation in protein interaction networks. In: Apostolico, A., Guerra, C., Istrail, S., Pevzner, P., Waterman, M. (eds.) RECOMB 2006. LNCS (LNBI), vol.\u00a03909, pp. 45\u201349. Springer, Heidelberg (2006)"},{"key":"41_CR10","first-page":"28","volume-title":"Proc. of FOCS 2003","author":"M. Mihail","year":"2003","unstructured":"Mihail, M., Papadimitriou, C., Saberi, A.: On Certain Connectivity Properties of the Internet Topology. In: Proc. of FOCS 2003, pp. 28\u201335. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"41_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/383059.383061","volume-title":"Proceedings of SIGCOMM 2001","author":"K. Park","year":"2001","unstructured":"Park, K., Lee, H.: On the effectiveness of route-based packet filtering for distributed DoS attack prevention in power-law internets. In: Proceedings of SIGCOMM 2001, pp. 15\u201326. ACM Press, New York (2001)"},{"key":"41_CR12","series-title":"Santa Fe Institute Studies on the Sciences of Complexity","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195157208.001.0001","volume-title":"The Internet as a Large-Scale Complex System","author":"K. Park","year":"2005","unstructured":"Park, K.: The Internet as a complex system. In: Park, K., Willinger, W. (eds.) The Internet as a Large-Scale Complex System. Santa Fe Institute Studies on the Sciences of Complexity, Oxford University Press, Oxford (2005)"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node- and Edge-Deletion NP-Complete Problems. In: Proceedings of STOC 1978. SIAM 1978, San Diego, California, pp. 253\u2013264 (1978)","DOI":"10.1145\/800133.804355"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T12:50:42Z","timestamp":1708174242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}