{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:36:38Z","timestamp":1725892598211},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21204-8_23","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T05:15:25Z","timestamp":1306559725000},"page":"196-207","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for Interval Structures with Applications"],"prefix":"10.1007","author":[{"given":"Danny Z.","family":"Chen","sequence":"first","affiliation":[]},{"given":"Ewa","family":"Misio\u0142ek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristan, V.: Smallest color-spanning objects. In: Proceedings of the 9th Annual European Symposium, pp. 278\u2013289 (2001)","DOI":"10.1007\/3-540-44676-1_23"},{"issue":"5","key":"23_CR2","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/BF01192049","volume":"14","author":"M.J. Atallah","year":"1995","unstructured":"Atallah, M.J., Chen, D.Z., Lee, D.T.: An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications. Algorithmica\u00a014(5), 429\u2013441 (1995)","journal-title":"Algorithmica"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0196-6774(03)00080-4","volume":"49","author":"D.Z. Chen","year":"2003","unstructured":"Chen, D.Z., Daescu, O., Hu, X., Xu, J.: Finding an optimal path without growing the tree. Journal of Algorithms\u00a049(1), 13\u201341 (2003)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"23_CR4","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1002\/(SICI)1097-0037(199807)31:4<249::AID-NET5>3.0.CO;2-D","volume":"31","author":"D.Z. Chen","year":"1998","unstructured":"Chen, D.Z., Lee, D.T., Sridhar, R., Sekharan, C.N.: Solving the all-pair shortest path query problem on interval and circular-arc graphs. Networks\u00a031(4), 249\u2013257 (1998)","journal-title":"Networks"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Chen, D.Z., Misio\u0142ek, E.: Computing feasible toolpaths for 5-axis machines. In: Proceedings of the 4th Annual International Conference on Combinatorial Optimization and Applications - Volume Part I, pp. 270\u2013284 (2010)","DOI":"10.1007\/978-3-642-17458-2_23"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Daescu, O., Ju, W., Luo, J.: NP-completeness of spreading colored points. In: Proceedings of the 4th Annual International Conference on Combinatorial Optimization and Applications, pp. 41\u201350 (2010)","DOI":"10.1007\/978-3-642-17458-2_5"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Das, S., Goswami, P.P., Nandy, S.C.: Recognition of minimum width color-spanning corridor and minimum area color-spanning rectangle. In: Proceedings of the 11th International Conference on Computational Science and Its Applications, pp. 69\u201379 (2005)","DOI":"10.1007\/11424758_85"},{"issue":"5","key":"23_CR8","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1142\/S0218195909003076","volume":"19","author":"S. Das","year":"2009","unstructured":"Das, S., Goswami, P.P., Nandy, S.C.: Smallest color-spanning object revisited. International Journal of Computational Geometry and Applications\u00a019(5), 457\u2013478 (2009)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.jalgor.2005.01.010","volume":"57","author":"M. Berg de","year":"2005","unstructured":"de Berg, M., Gudmundsson, J., Katz, M.J., Levcopoulos, C., Overmars, M.H., van der Stappen, A.F.: TSP with neighborhoods of varying size. Journal of Algorithms\u00a057, 22\u201336 (2005)","journal-title":"Journal of Algorithms"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Elbassioni, K., Fishkin, A.V., Mustafa, N.H., Sitters, R.: Approximation algorithms for euclidean group TSP. In: The 32nd International Colloquium on Automata, Languages and Programming, pp. 1115\u20131126 (2005)","DOI":"10.1007\/11523468_90"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Fleischer, R., Xu, X.: Computing minimum diameter color-spanning sets. In: Proceedings of the 4th International Conference on Frontiers in Algorithmics, pp. 285\u2013292 (2010)","DOI":"10.1007\/978-3-642-14553-7_27"},{"key":"23_CR12","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol.\u00a057. North-Holland Publishing Co., Amsterdam (2004)"},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(91)90165-E","volume":"40","author":"W.-L. Hsu","year":"1991","unstructured":"Hsu, W.-L., Tsai, K.-H.: Linear time algorithms on circular-arc graphs. Information Processing Letters\u00a040(3), 123\u2013129 (1991)","journal-title":"Information Processing Letters"},{"key":"23_CR14","unstructured":"Mitchell, J.S.B.: A PTAS for TSP with neighborhoods among fat regions in the plane. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 11\u201318 (2007)"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0925-7721(00)00021-3","volume":"17","author":"D.M. Mount","year":"2000","unstructured":"Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: Chromatic nearest neighbor searching: a query sensitive approach. Computational Geometry: Theory and Applications\u00a017, 97\u2013119 (2000)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ipl.2007.08.029","volume":"105","author":"A. Mukhopadhyay","year":"2008","unstructured":"Mukhopadhyay, A., Kumar, C., Greene, E., Bhattacharya, B.: On intersecting a set of parallel line segments with a convex polygon of minimum area. Information Processing Letters\u00a0105, 58\u201364 (2008)","journal-title":"Information Processing Letters"},{"issue":"3","key":"23_CR17","first-page":"256","volume":"3","author":"S. Natarajan","year":"1996","unstructured":"Natarajan, S., Sprague, A.P.: Disjoint paths in circular arc graphs. Nordic Journal of Computing\u00a03(3), 256\u2013270 (1996)","journal-title":"Nordic Journal of Computing"},{"issue":"3","key":"23_CR18","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1142\/S0218195995000143","volume":"5","author":"D. Rappaport","year":"1995","unstructured":"Rappaport, D.: Minimum polygon transversals of line segments. International Journal of Computational Geometry and Applications\u00a05(3), 243\u2013256 (1995)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1002\/net.3230220103","volume":"22","author":"R. Ravi","year":"1992","unstructured":"Ravi, R., Marathe, M.V., Rangan, C.P.: An optimal algorithm to solve the all-pair shortest path problem on interval graphs. Networks\u00a022, 21\u201335 (1992)","journal-title":"Networks"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Roberts, F.S.: Graph Theory and Its Applications to Problems of Society. Society for Industrial Mathematics (1978)","DOI":"10.1137\/1.9781611970401"},{"issue":"11","key":"23_CR21","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1016\/S0010-4485(02)00162-8","volume":"35","author":"K. Tang","year":"2003","unstructured":"Tang, K., Pang, A.: Optimal connection of loops in laminated object manufacturing. Computer-Aided Design\u00a035(11), 1011\u20131022 (2003)","journal-title":"Computer-Aided Design"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T08:10:41Z","timestamp":1560240641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}