{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:48:15Z","timestamp":1764841695410},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614227"},{"type":"electronic","value":"9783540685296"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61422-2_127","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:36:52Z","timestamp":1330292212000},"page":"136-148","source":"Crossref","is-referenced-by-count":27,"title":["Greedily finding a dense subgraph"],"prefix":"10.1007","author":[{"given":"Yuichi","family":"Asahiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuo","family":"Iwama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hisao","family":"Tamaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Tokuyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Y. Asahiro and K. Iwama. Finding dense subgraphs. Proc. International Symposium on Algorithms and Computation '95, Lecture Notes in Computer Science 1004, 102\u2013111, 1995","DOI":"10.1007\/BFb0015413"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. Proc. 27th ACM Symposium on Theory of Computing, 284\u2013293, 1995.","DOI":"10.1145\/225058.225140"},{"key":"13_CR3","unstructured":"M. Gr\u00f6tschel and L. Lov\u00e0sz. Combinatorial Optimization: A Survey. In Handbook of Combinatorics, North-Holland, 1995."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"G. Kortsarz and D. Peleg. Generating sparse 2-spanners. Proc. 3rd Scandinavian Workshop on Algorithm Theory, 73\u201382, 1992.","DOI":"10.1007\/3-540-55706-7_7"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"G. Kortsarz and D. Peleg. On choosing a dense subgraph. Proc. 34th IEEE Symposium on Foundations of Computer Science, 692\u2013701, 1993.","DOI":"10.1109\/SFCS.1993.366818"},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P. Raghavan","year":"1988","unstructured":"P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. Journal of Computer and System Sciences, 37:130\u2013143, 1988.","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"S.S. Ravi, D.J. Rosenkrantz, and G.K. Tayi. Facility dispersion problems: Heuristics and special cases. In Proc. 2nd Workshop on Algorithms and Data Structures, LNCS-519, 355\u2013366, 1991.","DOI":"10.1007\/BFb0028275"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61422-2_127.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:05:59Z","timestamp":1605647159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61422-2_127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614227","9783540685296"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-61422-2_127","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}