{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:54:38Z","timestamp":1725533678662},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642021572"},{"type":"electronic","value":"9783642021589"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02158-9_10","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T15:36:06Z","timestamp":1245252966000},"page":"100-113","source":"Crossref","is-referenced-by-count":1,"title":["Line Segment Facility Location in Weighted Subdivisions"],"prefix":"10.1007","author":[{"given":"Yam Ki","family":"Cheung","sequence":"first","affiliation":[]},{"given":"Ovidiu","family":"Daescu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/11821069_9","volume-title":"Mathematical Foundations of Computer Science 2006","author":"L. Aleksandrov","year":"2006","unstructured":"Aleksandrov, L., Djidjev, H.N., Guo, H., Maheshwari, A., Nussbaum, D., Sack, J.R.: Algorithms for approximate shortest path Queries on weighted polyhedral surfaces. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 98\u2013109. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Aleksandrov, L., Maheshwari, A.A., Sack, J.R.: Approximation algorithms for geometric shortest path problems. In: Proc. 32nd Annual ACM Symposium on Theory of Computing, pp. 286\u2013295 (2000)","key":"10_CR2","DOI":"10.1145\/335305.335339"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1044731.1044733","volume":"52","author":"L. Aleksandrov","year":"2005","unstructured":"Aleksandrov, L., Maheshwari, A., Sack, J.R.: Determining approximate shortest paths on weighted polyhedral surfaces. Journal of the ACM\u00a052(1), 25\u201353 (2005)","journal-title":"Journal of the ACM"},{"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, pp. 705\u2013706 (2000)","key":"10_CR4"},{"issue":"1","key":"10_CR5","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. Journal of Combinatorial Optimization\u00a05(1), 59\u201379 (2001)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"10_CR6","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 Optimal Beams in Two and Three Dimensions. Journal of Combinatorial Optimization\u00a07(2), 111\u2013136 (2003)","journal-title":"Journal of Combinatorial Optimization"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1137\/06067777X","volume":"38","author":"S.W. Cheng","year":"2008","unstructured":"Cheng, S.W., Na, H.S., Vigneron, A., Wang, Y.: Approximate shortest paths in anisotropic regions. SIAM Journal on Computing\u00a038, 802\u2013824 (2008)","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Cheng, S.W., Na, H.S., Vigneron, A., Wang, Y.: Querying approximate shortest paths in anisotropic regions. In: Proc. 23rd Symposium on Computational Geometry, pp. 84\u201391 (2007)","key":"10_CR8","DOI":"10.1145\/1247069.1247082"},{"doi-asserted-by":"crossref","unstructured":"Cheung, Y., Daescu, O.: Line Facility Location in Weighted Regions. In: Proc. 4th Intl. Conf. on Algorithmic Aspects in Information and Management, pp. 109\u2013119 (2008)","key":"10_CR9","DOI":"10.1007\/978-3-540-68880-8_12"},{"doi-asserted-by":"crossref","unstructured":"Daescu, O.: Improved optimal weighted links algorithms. In: Proc. ICCS, 2nd International Workshop on Computational Geometry and Applications, pp. 227\u2013233 (2002)","key":"10_CR10","DOI":"10.1007\/3-540-47789-6_7"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1142\/S0218195909002824","volume":"19","author":"O. Daescu","year":"2009","unstructured":"Daescu, O., Palmer, J.: Minimum Separation in Weighted Subdivisions. International Journal of Computational Geometry and Applications\u00a019(1), 33\u201357 (2009)","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01553880","volume":"4","author":"H. Imai","year":"1989","unstructured":"Imai, H., Kato, K., Yamamoto, P.: A linear-time algorithm for linear L 1 approximation of points. Algorithmica\u00a04(1), 77\u201396 (1989)","journal-title":"Algorithmica"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/S0196-6774(03)00098-1","volume":"50","author":"M.X. Goemans","year":"2004","unstructured":"Goemans, M.X., Skutella, M.: Cooperative facility location games. Journal of Algorithms\u00a050(2), 194\u2013214 (2004)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/0604021","volume":"4","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N., Tamir, A.: Finding Least-Distance Lines. SIAM Journal of Algebraic Discrete Methods\u00a04(2), 207\u2013211 (1983)","journal-title":"SIAM Journal of Algebraic Discrete Methods"},{"issue":"1","key":"10_CR15","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":"10_CR16","doi-asserted-by":"publisher","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)"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2004.07.004","volume":"58","author":"Z. Sun","year":"2006","unstructured":"Sun, Z., Reif, J.H.: On finding approximate optimal path in weighted regions. Journal of Algorithms\u00a058(1), 1\u201332 (2006)","journal-title":"Journal of Algorithms"},{"unstructured":"Toussaint, G.T.: Solving geometric problems with the rotating calipers. In: Proc. 2nd IEEE Mediterranean Electrotechnical Conference (MELECON 1983), pp. 1\u20134 (1983)","key":"10_CR18"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02158-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T14:03:51Z","timestamp":1633615431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02158-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642021572","9783642021589"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02158-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}