{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T09:13:25Z","timestamp":1782897205601,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540679967","type":"print"},{"value":"9783540444367","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44436-x_10","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T05:33:14Z","timestamp":1182144794000},"page":"84-95","source":"Crossref","is-referenced-by-count":289,"title":["Greedy Approximation Algorithms for Finding Dense Components in a Graph"],"prefix":"10.1007","author":[{"given":"Moses","family":"Charikar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"10_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/BFb0015413","volume-title":"Proc. 6th International Symposium on Algorithms and Computation (ISAAC)","author":"Y. Asahiro","year":"1995","unstructured":"Y. Asahiro and K. Iwama. Finding Dense Subgraphs. Proc. 6th International Symposium on Algorithms and Computation (ISAAC), LNCS 1004, 102\u2013111 (1995)."},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jagm.1999.1062","volume":"34","author":"Y. Asahiro","year":"2000","unstructured":"Y. Asahiro, K. Iwama, H. Tamaki and T. Tokuyama. Greedily Finding a Dense Subgraph. Journal of Algorithms, 34(2):203\u2013221 (2000).","journal-title":"Journal of Algorithms"},{"key":"10_CR3","unstructured":"P. Drineas, A. Frieze, R. Kannan, S. Vempala and V. Vinay. Clustering in Large Graphs and Matrices. Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 291\u2013299 (1999)."},{"key":"10_CR4","unstructured":"U. Feige, G. Kortsarz and D. Peleg. The Dense k-Subgraph Problem. Algorithmica, to appear. Preliminary version in Proc. 34th Annual IEEE Symposium on Foundations of Computer Science, 692\u2013701 (1993)."},{"key":"10_CR5","unstructured":"U. Feige and M. Seltser. On the Densest k-Subgraph Problem. Weizmann Institute Technical Report CS 97-16 (1997)."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"A. Frieze, R. Kannan and S. Vempala. Fast Monte-Carlo Algorithms for Finding Low Rank Approximations. Proc. 39th Annual IEEE Symposium on Foundations of Computer Science, 370\u2013378 (1998).","DOI":"10.1109\/SFCS.1998.743487"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G. Gallo","year":"1989","unstructured":"G. Gallo, M. D. Grigoriadis, and R. Tarjan. A Fast Parametric Maximum Flow Algorithm and Applications. SIAM J. on Comput., 18:30\u201355 (1989).","journal-title":"SIAM J. on Comput."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"D. Gibson, J. Kleinberg and P. Raghavan. Inferring web communities from Web topology. Proc. HYPERTEXT, 225\u2013234 (1998).","DOI":"10.1145\/276627.276652"},{"key":"10_CR9","unstructured":"R. Kannan and V. Vinay. Analyzing the Structure of Large Graphs. manuscript, August 1999."},{"key":"10_CR10","unstructured":"J. Kleinberg. Authoritative sources in hypertext linked environments. Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 668\u2013677 (1998)."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"J. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan and A. Tomkins. The web as a graph: measurements, models, and methods. Proc. 5th Annual International Conference on Computing and Combinatorics (COCOON), 1\u201317 (1999).","DOI":"10.1007\/3-540-48686-0_1"},{"issue":"11-16","key":"10_CR12","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1016\/S1389-1286(99)00040-7","volume":"31","author":"S. R. Kumar","year":"1999","unstructured":"S. R. Kumar, P. Raghavan, S. Rajagopalan and A. Tomkins. Trawling Emerging Cyber-Communities Automatically. Proc. 8th WWW Conference, Computer Networks, 31(11-16):1481\u20131493, (1999).","journal-title":"Computer Networks"},{"key":"10_CR13","unstructured":"13. E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston (1976)."}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44436-X_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T05:23:27Z","timestamp":1550381007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44436-X_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679967","9783540444367"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44436-x_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}