{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T00:29:11Z","timestamp":1673569751807},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,10,27]],"date-time":"2009-10-27T00:00:00Z","timestamp":1256601600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s10878-009-9272-3","type":"journal-article","created":{"date-parts":[[2009,10,26]],"date-time":"2009-10-26T19:49:06Z","timestamp":1256586546000},"page":"52-70","source":"Crossref","is-referenced-by-count":1,"title":["Line facility location in weighted regions"],"prefix":"10.1007","volume":"22","author":[{"given":"Yam Ki","family":"Cheung","sequence":"first","affiliation":[]},{"given":"Ovidiu","family":"Daescu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,10,27]]},"reference":[{"key":"9272_CR1","author":"L Aleksandrov","year":"2009","unstructured":"Aleksandrov L, Djidjev HN, Guo H, Maheshwari A, Nussbaum D, Sack JR (2009) Algorithms for approximate shortest path Queries on weighted polyhedral surfaces. Discrete Comput. Geom. doi: 10.1007\/s0454-009-9204-0","journal-title":"Discrete Comput. Geom."},{"key":"9272_CR2","doi-asserted-by":"crossref","unstructured":"Aleksandrov L, Maheshwari AA, Sack JR (2000) Approximation algorithms for geometric shortest path problems. In: Proc 32nd annual ACM symposium on theory of computing, pp\u00a0286\u2013295","DOI":"10.1145\/335305.335339"},{"issue":"1","key":"9272_CR3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1044731.1044733","volume":"52","author":"L Aleksandrov","year":"2005","unstructured":"Aleksandrov L, Maheshwari A, Sack JR (2005) Determining approximate shortest paths on weighted polyhedral surfaces. J ACM 52(1):25\u201353","journal-title":"J ACM"},{"key":"9272_CR4","unstructured":"Amato NM, Goodrich MT, Ramos EA (2000) Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling. In: Proc 11th annual CAM-SIAM symposium on discrete algorithms, pp\u00a0705\u2013706"},{"issue":"1","key":"9272_CR5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1009885517653","volume":"5","author":"DZ Chen","year":"2001","unstructured":"Chen DZ, Daescu O, Hu X, Wu X, Xu J (2001) Determining an optimal penetration among weighted regions in two and three dimensions. J Comb Optim 5(1):59\u201379","journal-title":"J Comb Optim"},{"issue":"2","key":"9272_CR6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1024484412699","volume":"7","author":"DZ Chen","year":"2003","unstructured":"Chen DZ, Hu X, Xu J (2003) Computing optimal beams in two and three dimensions. J Comb Opt 7(2):111\u2013136","journal-title":"J Comb Opt"},{"key":"9272_CR7","doi-asserted-by":"crossref","unstructured":"Cheng SW, Na HS, Vigneron A, Wang Y (2007) Approximate shortest paths in anisotropic regions. In: Proc 18th annual ACM-SIAM symposium on discrete algorithms, pp\u00a0766\u2013774","DOI":"10.1145\/1247069.1247082"},{"key":"9272_CR8","unstructured":"Cheng SW, Na HS, Vigneron A, Wang Y (2005) Querying approximate shortest paths in anisotropic regions. In: Proc 23rd annual symposium on computational geometry, pp\u00a084\u201391"},{"key":"9272_CR9","doi-asserted-by":"crossref","unstructured":"Cheung Y, Daescu O (2008) Line facility location in weighted regions. In: Proc 4th intl conf on algorithmic aspects in information and management, pp\u00a0109\u2013119","DOI":"10.1007\/978-3-540-68880-8_12"},{"key":"9272_CR10","doi-asserted-by":"crossref","unstructured":"Cheung Y, Daescu O, Kurdia A (2008) A new modeling for finding optimal weighted distances. In: Proc 2008 international conference on biocomputation, bioinformatics, and biomedical technologies (BIOTECHNO\u201908), pp\u00a041\u201346","DOI":"10.1109\/BIOTECHNO.2008.31"},{"key":"9272_CR11","first-page":"66","volume":"3","author":"Y Cheung","year":"2009","unstructured":"Cheung Y, Daescu O, Palmer JD (2009) Parallel optimal weighted links. Trans Comput Sci 3:66\u201381","journal-title":"Trans Comput Sci"},{"key":"9272_CR12","unstructured":"Daescu O (2002) Improved optimal weighted links algorithms. In: Proc ICCS, 2nd international workshop on computational geometry and applications, pp\u00a0227\u2013233"},{"issue":"1","key":"9272_CR13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1142\/S0218195909002824","volume":"19","author":"O Daescu","year":"2009","unstructured":"Daescu O, Palmer J (2009) Minimum separation in weighted subdivisions. Int J Comput Geom Appl 19(1):33\u201357","journal-title":"Int J Comput Geom Appl"},{"issue":"1","key":"9272_CR14","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01553880","volume":"4","author":"H Imai","year":"1989","unstructured":"Imai H, Kato K, Yamamoto P (1989) A linear-time algorithm for linear L 1 approximation of points. Algorithmica 4(1):77\u201396","journal-title":"Algorithmica"},{"key":"9272_CR15","unstructured":"Goemans MX, Skutella M (2000) Cooperative facility location games. In: Proc 11th annual ACM-SIAM symposium on discrete algorithms (SODA), pp\u00a076\u201385"},{"issue":"2","key":"9272_CR16","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0604021","volume":"4","author":"N Megiddo","year":"1983","unstructured":"Megiddo N, Tamir A (1983) Finding least-distance lines. SIAM J Algebraic Discrete Methods 4(2):207\u2013211","journal-title":"SIAM J Algebraic Discrete Methods"},{"issue":"1","key":"9272_CR17","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/102782.102784","volume":"38","author":"JSB Mitchell","year":"1991","unstructured":"Mitchell JSB, Papdimitriou CH (1991) The weighted region problem: Finding shortest paths through a weighted planer subdivision. J ACM 38(1):18\u201373","journal-title":"J ACM"},{"key":"9272_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry: an introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata FP, Shamos MI (1985) Computational geometry: an introduction. Springer, New York"},{"issue":"1","key":"9272_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jalgor.2004.07.004","volume":"58","author":"Z Sun","year":"2006","unstructured":"Sun Z, Reif JH (2006) On finding approximate optimal path in weighted regions. J Algorithms 58(1):1\u201332","journal-title":"J Algorithms"},{"key":"9272_CR20","unstructured":"Toussaint GT (1983) Solving geometric problems with the \u2018rotating calipers\u2019. In: Proc 2nd IEEE Mediterranean electrotechnical conference (MELECON\u201983), pp\u00a0A10.02\/1\u20134"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9272-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9272-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9272-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:15Z","timestamp":1559276295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9272-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,27]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9272"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9272-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,27]]}}}