{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:11Z","timestamp":1725558971874},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245742"},{"type":"electronic","value":"9783540318330"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31833-0_9","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T18:11:05Z","timestamp":1278094265000},"page":"83-96","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for Spreading Points"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Cabello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/1097-0118(200010)35:2<83::AID-JGT2>3.0.CO;2-V","volume":"35","author":"R. Aharoni","year":"2000","unstructured":"Aharoni, R., Haxell, P.: Hall\u2019s theorem for hypergraphs. Journal of Graph Theory\u00a035, 83\u201388 (2000)","journal-title":"Journal of Graph Theory"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/1097-0037(200010)36:3<147::AID-NET1>3.0.CO;2-M","volume":"36","author":"E. Arkin","year":"2000","unstructured":"Arkin, E., Hassin, R.: Minimum diameter covering problems. Networks\u00a036, 147\u2013155 (2000)","journal-title":"Networks"},{"key":"#cr-split#-9_CR3.1","doi-asserted-by":"crossref","unstructured":"Baur, C., Fekete, S.: Approximation of geometric dispersion problems. Algorithmica, 30, 451???470 (2001);","DOI":"10.1007\/s00453-001-0022-x"},{"key":"#cr-split#-9_CR3.2","unstructured":"A preliminary version appeared In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol.??1444, pp. 451???470. Springer, Heidelberg (1998)"},{"key":"9_CR4","unstructured":"Cabello, S.: Approximation algorithms for spreading points. Technical report UU-CS-2003-040 (2003), Available at http:\/\/www.cs.uu.nl\/research\/techreps\/UU-CS-2003-040.html"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s00453-003-1033-6","volume":"37","author":"S. Cabello","year":"2003","unstructured":"Cabello, S., van Kreveld, M.: Approximation algorithms for aligning points. Algorithmica\u00a037, 211\u2013232 (2003), A preliminary version appeared in SoCG 2003","journal-title":"Algorithmica"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1006\/jagm.2000.1145","volume":"38","author":"B. Chandra","year":"2001","unstructured":"Chandra, B., Halld\u00f3rsson, M.M.: Approximation algorithms for dispersion problems. J. Algorithms\u00a038, 438\u2013465 (2001)","journal-title":"J. Algorithms"},{"key":"9_CR7","volume-title":"Cartography: Thematic Map Design","author":"B. Dent","year":"1999","unstructured":"Dent, B.: Cartography: Thematic Map Design, 5th edn. McGraw-Hill, New York (1999)","edition":"5"},{"key":"9_CR8","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-001-0016-8","volume":"31","author":"A. Efrat","year":"2001","unstructured":"Efrat, A., Itai, A., Katz, M.J.: Geometry helps in bottleneck matching and related problems. Algorithmica\u00a031(1), 1\u201328 (2001)","journal-title":"Algorithmica"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Fekete, S., Meijer, H.: Maximum dispersion and geometric maximum weight cliques. To appear in Algorithmica\u00a038(3) (2004)","DOI":"10.1007\/s00453-003-1074-x"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-36151-0_11","volume-title":"Graph Drawing","author":"J. Fiala","year":"2002","unstructured":"Fiala, J., Kratochv\u00edl, J., Proskurowski, A.: Geometric systems of disjoint representatives. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 110\u2013117. Springer, Heidelberg (2002)"},{"key":"9_CR12","unstructured":"Fiala, J., Kratochv\u00edl, J., Proskurowski, A.: Systems of sets and their representatives. Technical Report 2002-573, KAM-DIMATIA (2002), Available at http:\/\/dimatia.mff.cuni.cz\/"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Formann, M., Wagner, F.: A packing problem with applications to lettering of maps. In: Proc. 7th Annu. ACM Sympos. Comput. Geom., pp. 281\u2013288 (1991)","DOI":"10.1145\/109648.109680"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0167-6377(97)00034-5","volume":"21","author":"R. Hassin","year":"1997","unstructured":"Hassin, R., Rubinstein, S., Tamir, A.: Approximation algorithms for maximum dispersion. Operations Research Letters\u00a021, 133\u2013137 (1997)","journal-title":"Operations Research Letters"},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM\u00a030(4), 852\u2013865 (1983)","journal-title":"J. ACM"},{"key":"9_CR16","unstructured":"Mortensen, C.W.: Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time. In: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, pp. 618\u2013627 (2003)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Simons, B.: A fast algorithm for single processor scheduling. In: Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci., pp. 246\u2013252 (1978)","DOI":"10.1109\/SFCS.1978.4"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31833-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:27:42Z","timestamp":1605760062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31833-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245742","9783540318330"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31833-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}