{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:53Z","timestamp":1759637873158,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_17","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T08:09:41Z","timestamp":1458547781000},"page":"220-234","source":"Crossref","is-referenced-by-count":7,"title":["Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs"],"prefix":"10.1007","author":[{"given":"Kate\u0159ina","family":"B\u00f6hmov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yann","family":"Disser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mat\u00fa\u0161","family":"Mihal\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rastislav","family":"\u0160r\u00e1mek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"key":"17_CR1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G Ausiello","year":"2012","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer Science & Business Media, Heidelberg (2012)"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703437843","volume":"36","author":"R Bar-Yehuda","year":"2006","unstructured":"Bar-Yehuda, R., Halld\u00f3rsson, M.M., Naor, J., Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM J. Comput. 36(1), 1\u201315 (2006)","journal-title":"SIAM J. Comput."},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-27801-6_23","volume-title":"Combinatorial Pattern Matching","author":"G Blin","year":"2004","unstructured":"Blin, G., Fertin, G., Vialette, S.: New results for the 2-interval pattern problem. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 311\u2013322. Springer, Heidelberg (2004)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-40104-6_15","volume-title":"Algorithms and Data Structures","author":"K B\u00f6hmov\u00e1","year":"2013","unstructured":"B\u00f6hmov\u00e1, K., Disser, Y., Mihal\u00e1k, M., Widmayer, P.: Interval selection with machine-dependent intervals. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 170\u2013181. Springer, Heidelberg (2013)"},{"key":"17_CR5","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, vol. 3. MIT Press, Cambridge (2001)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Crescenzi, P.: A short guide to approximation preserving reductions. In: 12th IEEE Conference on Computational Complexity, pp. 262\u2013273. IEEE (1997)","DOI":"10.1109\/CCC.1997.612321"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/11561071_39","volume-title":"Algorithms \u2013 ESA 2005","author":"M Crochemore","year":"2005","unstructured":"Crochemore, M., Hermelin, D., Landau, G.M., Vialette, S.: Approximating the 2-interval pattern problem. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 426\u2013437. Springer, Heidelberg (2005)"},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1109\/TSE.1976.233819","volume":"2","author":"HN Gabow","year":"1976","unstructured":"Gabow, H.N., Maheshwari, S.N., Osterweil, L.J.: On two problems in the generation of program test paths. IEEE Trans. Softw. Eng. 2(3), 227\u2013231 (1976)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"17_CR9","first-page":"1192","volume":"254","author":"A Ghouila-Houri","year":"1962","unstructured":"Ghouila-Houri, A.: Caracterisation des matrices totalement unimodulaires. CR Acad. Sci. Paris 254, 1192\u20131194 (1962)","journal-title":"CR Acad. Sci. Paris"},{"issue":"5","key":"17_CR10","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1002\/nav.20231","volume":"54","author":"AWJ Kolen","year":"2007","unstructured":"Kolen, A.W.J., Lenstra, J.K., Papadimitriou, C.H., Spieksma, F.C.R.: Interval scheduling: a survey. Naval Res. Logistics (NRL) 54(5), 530\u2013543 (2007)","journal-title":"Naval Res. Logistics (NRL)"},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.ejor.2006.01.049","volume":"178","author":"MY Kovalyov","year":"2007","unstructured":"Kovalyov, M.Y., Ng, C., Cheng, T.E.: Fixed interval scheduling: models, applications, computational complexity and algorithms. Eur. J. Oper. Res. 178(2), 331\u2013342 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR12","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, Chichester (1998)"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.ipl.2014.10.014","volume":"115","author":"Y Song","year":"2015","unstructured":"Song, Y., Yu, M.: On finding the longest antisymmetric path in directed acyclic graphs. Inf. Process. Lett. 115(2), 377\u2013381 (2015)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T21:29:18Z","timestamp":1748813358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}