{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:59:37Z","timestamp":1725515977691},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688655"},{"type":"electronic","value":"9783540688808"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_12","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T02:37:59Z","timestamp":1217471879000},"page":"109-119","source":"Crossref","is-referenced-by-count":3,"title":["Line Facility Location in Weighted Regions"],"prefix":"10.1007","author":[{"given":"Yam Ki","family":"Cheung","sequence":"first","affiliation":[]},{"given":"Ovidiu","family":"Daescu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Amato, N.M., Goodrich, M.T., Ramos, E.A.: Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling. In: Proc. 11th Annual CAM-SIAM Symposium on Discrete Algorithms, 2000, pp. 705\u2013706 (2000)"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1009885517653","volume":"5","author":"D.Z. Chen","year":"2001","unstructured":"Chen, D.Z., Daescu, O., Hu, X., Wu, X., Xu, J.: Determining an optimal penetration among weighted regions in two and three dimensions. J. combinat. Optim.\u00a05(1), 59\u201379 (2001)","journal-title":"J. combinat. Optim."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1024484412699","volume":"7","author":"D.Z. Chen","year":"2003","unstructured":"Chen, D.Z., Hu, X., Xu, J.: Computing Beams in Two and Three Dimensions. Journal of Combinatorial Optimization\u00a07, 111\u2013136 (2003)","journal-title":"Journal of Combinatorial Optimization"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Daescu, O.: Improved optimal weighted links algorithms. In: Proceedings of ICCS, 2nd International Workshop on Computational Geometry and Applications, pp. 227\u2013233 (2002)","DOI":"10.1007\/3-540-47789-6_7"},{"key":"12_CR5","unstructured":"Daescu, O., Palmer, J.: Minimum Separation in Weighted Subdivisions. The International J. Computat. Geom. & Appl. (Submitted, 2003) (Manuscript)"},{"key":"12_CR6","unstructured":"Michel, X.: Cooperative facility location games. In: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms SODA 2000(2000)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Megiddo, N., Tamir, A.: Finding Least-Distance Lines. SIAM J. ALG. DISC. MATH.\u00a04(2) (1983)","DOI":"10.1137\/0604021"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/102782.102784","volume":"38","author":"J.S.B. Mitchell","year":"1991","unstructured":"Mitchell, J.S.B., Papdimitriou, C.H.: The weighted region problem: Finding shortest paths through a weighted planer subdivision. Journal of the ACM\u00a038(1), 18\u201373 (1991)","journal-title":"Journal of the ACM"},{"key":"12_CR9","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":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T07:24:47Z","timestamp":1684481087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}