{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:32:39Z","timestamp":1725525159102},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002113"},{"type":"electronic","value":"9783642002120"}],"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-00212-0_4","type":"book-chapter","created":{"date-parts":[[2009,2,13]],"date-time":"2009-02-13T10:39:46Z","timestamp":1234521586000},"page":"66-81","source":"Crossref","is-referenced-by-count":1,"title":["Parallel Optimal Weighted Links"],"prefix":"10.1007","author":[{"given":"Ovidiu","family":"Daescu","sequence":"first","affiliation":[]},{"given":"Yam K.","family":"Cheung","sequence":"additional","affiliation":[]},{"given":"James D.","family":"Palmer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BFb0054351","volume-title":"Algorithm Theory - SWAT\u201998","author":"L. Aleksandrov","year":"1998","unstructured":"Aleksandrov, L., Lanthier, M., Maheshwari, A., Sack, J.-R.: An \u03b5-approximation algorithm for weighted shortest paths on polyhedral surfaces. In: Arnborg, S. (ed.) SWAT 1998. LNCS, vol.\u00a01432, pp. 11\u201322. Springer, Heidelberg (1998)"},{"issue":"1","key":"4_CR2","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"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Aleksandrov, L., Maheshwari, A., Sack, J.-R.: Approximation algorithms for geometric shortest path problems. In: Proceedings of the 32nd annual ACM Symposium on Theory of Computing, pp. 286\u2013295 (2000)","DOI":"10.1145\/335305.335339"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0925-7721(93)90027-4","volume":"3","author":"M.H. Alsuwaiyel","year":"1993","unstructured":"Alsuwaiyel, M.H., Lee, D.T.: Minimal Visibility Paths Inside a Simple Polygon. Computational Geometry: Theory and Applications\u00a03, 1\u201325 (1993)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0020-0190(95)00072-K","volume":"55","author":"M.H. Alsuwaiyel","year":"1995","unstructured":"Alsuwaiyel, M.H., Lee, D.T.: Finding an Approximate Minimum-Link Visibility Paths Inside a Simple Polygon. Information processing letters\u00a055, 75\u201379 (1995)","journal-title":"Information processing letters"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1142\/S0218195994000094","volume":"4","author":"T. Asano","year":"1994","unstructured":"Asano, T., Guibas, L.J., Tokuyama, T.: Walking in an arrangement topologically. Int. Journal of Computational Geometry and Applications\u00a04, 123\u2013151 (1994)","journal-title":"Int. Journal of Computational Geometry and Applications"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1016\/0360-3016(94)90213-5","volume":"28","author":"A. Brahme","year":"1994","unstructured":"Brahme, A.: Optimization of radiation therapy. Int. Jouurnal of Radiat. Oncol. Biol. Phys.\u00a028, 785\u2013787 (1994)","journal-title":"Int. Jouurnal of Radiat. Oncol. Biol. Phys."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/147508.147511","volume":"39","author":"B. Chazelle","year":"1992","unstructured":"Chazelle, B., Edelsbrunner, H.: An optimal algorithm for intersecting line segments in the plane. Journal of the ACM\u00a039, 1\u201354 (1992)","journal-title":"Journal of the ACM"},{"issue":"1","key":"4_CR9","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":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10878-005-5485-2","volume":"9","author":"D.Z. Chen","year":"2005","unstructured":"Chen, D.Z., Daescu, O., Dai, Y., Katoh, N., Wu, X., Xu, J.: Optimizing the sum of linear fractional functions and applications. Journal of Combinatorial Optimization\u00a09(1), 69\u201390 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"4_CR11","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.: Optimal Beam Penetration in Two and Three Dimensions. Journal of Combinatorial Optimization\u00a07(2), 111\u2013136 (2003)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1142\/S0218195903001104","volume":"13","author":"D.Z. Chen","year":"2003","unstructured":"Chen, D.Z., Luan, S., Xu, J.: Topological Peeling and Applications. Int. J. Comput. Geometry Appl.\u00a013(2), 135\u2013172 (2003)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Cheng, S.-W., Na, H.-S., Vigneron, A., Wang, Y.: Approximate Shortest Paths in Anisotropic Regions. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 766\u2013774 (2007)","DOI":"10.1145\/1247069.1247082"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1137\/0218055","volume":"18","author":"R. Cole","year":"1989","unstructured":"Cole, R., Salowe, J., Steiger, W., Szemeredi, E.: Optimal Slope Selection. SIAM Journal of Computing\u00a018, 792\u2013810 (1989)","journal-title":"SIAM Journal of Computing"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/3-540-45545-0_75","volume-title":"Computational Science - ICCS 2001","author":"O. Daescu","year":"2001","unstructured":"Daescu, O.: Parallel Optimal Weighted Links. In: Alexandrov, V.N., Dongarra, J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds.) ICCS 2001. LNCS, vol.\u00a02073, pp. 649\u2013657. Springer, Heidelberg (2001)"},{"key":"4_CR16","unstructured":"Daescu, O., Palmer, J.D.: Minimum Separation in Weighted Subdivisions (manuscript, 2003)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/11534273_29","volume-title":"Algorithms and Data Structures","author":"O. Daescu","year":"2005","unstructured":"Daescu, O., Mitchell, J.S.B., Ntafos, S., Palmer, J.D., Yap, C.K.: k-Link Shortest Paths in Weighted Subdivisions. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol.\u00a03608, pp. 325\u2013337. Springer, Heidelberg (2005)"},{"key":"4_CR18","unstructured":"Daescu, O., Mitchell, J.S.B., Ntafos, S., Palmer, J.D., Yap, C.K.: An Experimental Study of Weighted k-Link Shortest Path Algorithms. In: Proceedings of the 7th International Workshop on the Algorithmic Foundations of Robotics (2006)"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0022-0000(89)90038-X","volume":"38","author":"H. Edelsbrunner","year":"1989","unstructured":"Edelsbrunner, H., Guibas, L.J.: Topologically sweeping an arrangement. Journal of Computer and System Sciences\u00a038, 165\u2013194 (1989)","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Falk, J.E., Palocsay, S.W.: Optimizing the Sum of Linear Fractional Functions. In: Floudas, C.A., Pardalos, P.M. (eds.) Collection: Recent Advances in Global Optimization, pp. 221\u2013258 (1992)","DOI":"10.1515\/9781400862528.221"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1137\/0220047","volume":"20","author":"M. Goodrich","year":"1991","unstructured":"Goodrich, M.: Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors. SIAM Journal on Computing\u00a020, 737\u2013755 (1991)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/BF01941685","volume":"15","author":"M. Goodrich","year":"1996","unstructured":"Goodrich, M., Ghouse, M.R., Bright, J.: Sweep methods for Parallel Computational Geometry. Algorithmica\u00a015, 126\u2013153 (1996)","journal-title":"Algorithmica"},{"issue":"4","key":"4_CR23","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00453-001-0027-5","volume":"30","author":"M. Lanthier","year":"2001","unstructured":"Lanthier, M., Maheshwari, A., Sack, J.-R.: Approximating weighted shortest paths on polyhedral surfaces. Algorithmica\u00a030(4), 527\u2013562 (2001)","journal-title":"Algorithmica"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/B978-044482537-7\/50013-9","volume-title":"Handbook of Comput. Geom.","author":"A. Maheshwari","year":"2000","unstructured":"Maheshwari, A., Sack, J.R., Djidjev, H.: Link Distance Problems. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Comput. Geom., pp. 519\u2013558. Elsevier Science, Amsterdam (2000)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Mata, C., Mitchell, J.S.B.: A new algorithm for computing shortest paths in weighted planar subdivisions. In: Proc. ACM Symp. Comput. Geom., pp. 264\u2013273 (1997)","DOI":"10.1145\/262839.262983"},{"key":"4_CR26","volume-title":"Handbook of Comput. Geom.","author":"J.S.B. Mitchell","year":"2000","unstructured":"Mitchell, J.S.B.: Geometric Shortest Paths and Network Optimization. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Comput. Geom. Elsevier Science, Amsterdam (2000)"},{"key":"4_CR27","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., Papadimitriou, C.H.: The weighted region problem: Finding shortest paths through a weighted planar subdivision. J. of the ACM\u00a038, 18\u201373 (1991)","journal-title":"J. of the ACM"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B., Piatko, C., Arkin, E.M.: Computing a shortest k-link path in a polygon. In: Proc. 33rd Annual IEEE Sympos. Found. Comput. Sci., pp. 573\u2013582 (1992)","DOI":"10.1109\/SFCS.1992.267794"},{"key":"4_CR29","unstructured":"Piatko, C.: Geometric bicriteria optimal path problems. PhD thesis, Cornell U (1993)"},{"key":"4_CR30","unstructured":"Reif, J.H., Sun, Z.: An efficient approximation algorithm for weighted-region shortest-path problem. In: Proc. of 4th Workshop on Algorithmic Found. of Robot., pp. 191\u2013203 (2000)"},{"issue":"1","key":"4_CR31","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 paths in weighted regions. J. Algorithms\u00a058(1), 1\u201332 (2006)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Transactions on Computational Science III"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00212-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T18:44:27Z","timestamp":1633113867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00212-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002113","9783642002120"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00212-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}