{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T09:18:52Z","timestamp":1737105532381,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679967"},{"type":"electronic","value":"9783540444367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44436-x_14","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T09:33:14Z","timestamp":1182159194000},"page":"132-141","source":"Crossref","is-referenced-by-count":1,"title":["Maximum Dispersion and Geometric Maximum Weight Cliques"],"prefix":"10.1007","author":[{"given":"S\u00e1ndor P.","family":"Fekete","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for NP-hard problems. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 284\u2013293, 1995.","DOI":"10.1145\/225058.225140"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Y. Asahiro, R. Hassin, and K. Iwama. Complexity of finding dense subgraphs. Manuscript, 2000.","DOI":"10.1006\/jagm.1999.1062"},{"key":"14_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/3-540-61422-2_127","volume-title":"Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT)","author":"Y. Asahiro","year":"1996","unstructured":"Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama. Greedily finding a dense graph. In Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT), volume 1097 of Lecture Notes in Computer Science, pages 136\u2013148. Springer-Verlag, 1996."},{"key":"14_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/3-540-61422-2_120","volume-title":"Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT)","author":"B. Chandra","year":"1996","unstructured":"B. Chandra and M. M. Halld\u00f3rsson. Facility dispersion and remote subgraphs. In Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT), volume 1097 of Lecture Notes in Computer Science, pages 53\u201365. Springer-Verlag, 1996."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0377-2217(90)90297-O","volume":"46","author":"E. Erkut","year":"1990","unstructured":"E. Erkut. The discrete p-dispersion problem. European Journal of Operations Research, 46:48\u201360, 1990.","journal-title":"European Journal of Operations Research"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"U. Feige, G. Kortsarz, and D. Peleg. The dense k-subgraph problem. Algorithmica, to appear.","DOI":"10.1007\/s004530010050"},{"key":"14_CR7","unstructured":"U. Feige and M. Seltser. On the densest k-subgraph problems. Technical ReportCS97-16, http:\/\/www.wisdom.weizmann.ac.il , 1997."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0167-6377(97)00034-5","volume":"21","author":"R. Hassin","year":"1997","unstructured":"R. Hassin, S. Rubinstein, and A. Tamir. Approximation algorithms for maximum dispersion. Operations Research Letters, 21:133\u2013137, 1997.","journal-title":"Operations Research Letters"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad. Clique is hard to approximate within n1-\u03b5. In Proceedings of the 37th IEEE Annual Symposium on Foundations of Computer Science, pages 627\u2013636, 1996.","DOI":"10.1109\/SFCS.1996.548522"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"G. Kortsarz and D. Peleg. On choosing a dense subgraph. In Proceedings of the 34th IEEE Annual Symposium on Foundations of Computer Science, pages 692\u2013701, Palo Alto, CA, 1993.","DOI":"10.1109\/SFCS.1993.366818"},{"key":"14_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985."},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1287\/opre.42.2.299","volume":"42","author":"S. S. Ravi","year":"1994","unstructured":"S. S. Ravi, D. J. Rosenkrantz, and G. K. Tayi. Heuristic and special case algorithms for dispersion problems. Operations Research, 42:299\u2013310, 1994.","journal-title":"Operations Research"},{"key":"14_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BFb0053974","volume-title":"Approximation Algorithms for Combinatorial Optimization (APPROX\u2019 98)","author":"A. Srivastav","year":"1998","unstructured":"A. Srivastav and K. Wolf. Finding dense subgraphs with semidefinite programming. In K. Jansen and J. Rolim, editors, Approximation Algorithms for Combinatorial Optimization (APPROX\u2019 98), volume 1444 of Lecture Notes in Computer Science, pages 181\u2013191, Aalborg, Denmark, 1998. Springer-Verlag."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/0404048","volume":"4","author":"A. Tamir","year":"1991","unstructured":"A. Tamir. Obnoxious facility location in graphs. SIAM Journal on Discrete Mathematics, 4:550\u2013567, 1991.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1287\/opre.46.1.157","volume":"46","author":"A. Tamir","year":"1998","unstructured":"A. Tamir. Comments on the paper: \u2018Heuristic and special case algorithms for dispersion problems\u2019 by, S. S. Ravi, D. J. Rosenkrantz, and G. K. Tayi. Operations Research, 46:157\u2013158, 1998.","journal-title":"Operations Research"}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T08:31:53Z","timestamp":1737102713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44436-X_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679967","9783540444367"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44436-x_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}