{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:49:41Z","timestamp":1725749381739},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642410185"},{"type":"electronic","value":"9783642410192"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41019-2_6","type":"book-chapter","created":{"date-parts":[[2013,9,18]],"date-time":"2013-09-18T11:31:38Z","timestamp":1379503898000},"page":"73-82","source":"Crossref","is-referenced-by-count":5,"title":["On the Complexity of Computing Optimal Private Park-and-Ride Plans"],"prefix":"10.1007","author":[{"given":"Martin","family":"Olsen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"12","key":"6_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P. Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoretical Computer Science\u00a0237(12), 123\u2013134 (2000)","journal-title":"Theoretical Computer Science"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pp. 14\u201323 (1992)","DOI":"10.1109\/SFCS.1992.267823"},{"key":"6_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Protasi, M., Marchetti-Spaccamela, A., Gambosi, G., Crescenzi, P., Kann, V.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, New York (1999)"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1287\/opre.1030.0106","volume":"52","author":"R. Baldacci","year":"2004","unstructured":"Baldacci, R., Maniezzo, V., Mingozzi, A.: An exact method for the car pooling problem based on lagrangean column generation. Operations Research\u00a052(3), 422\u2013439 (2004)","journal-title":"Operations Research"},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","volume":"32","author":"M. Bern","year":"1989","unstructured":"Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. Information Processing Letters\u00a032(4), 171\u2013176 (1989)","journal-title":"Information Processing Letters"},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jagm.1999.1042","volume":"33","author":"M. Charikar","year":"1999","unstructured":"Charikar, M., Chekuri, C., Cheung, T.-Y., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner problems. Journal of Algorithms\u00a033(1), 73\u201391 (1999)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research\u00a04(3), 233\u2013235 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"6_CR8","unstructured":"Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceedings of the 12th Annual IEEE Conference on Computational Complexity, CCC 1997, pp. 262\u2013273. IEEE Computer Society (1997)"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S.E. Dreyfus","year":"1971","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks\u00a01(3), 195\u2013207 (1971)","journal-title":"Networks"},{"key":"6_CR10","unstructured":"Helmert, M.: On the complexity of planning in transportation domains. In: Proceedings of ECP 2001, pp. 349\u2013360 (2001)"},{"key":"6_CR11","unstructured":"Helmert, M., Mattm\u00fcller, R., R\u00f6ger, G.: Approximation properties of planning benchmarks. In: Proceedings of the 2006 Conference on ECAI 2006: 17th European Conference on Artificial Intelligence, pp. 585\u2013589. IOS Press (2006)"},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences\u00a043(3), 425\u2013440 (1991)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","volume":"58","author":"S.N. Parragh","year":"2008","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems (part I). Journal f\u00fcr Betriebswirtschaft\u00a058(1), 21\u201351 (2008)","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"S.N. Parragh","year":"2008","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems (part II). Journal f\u00fcr Betriebswirtschaft\u00a058(2), 81\u2013117 (2008)","journal-title":"Journal f\u00fcr Betriebswirtschaft"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41019-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T07:37:55Z","timestamp":1558078675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41019-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642410185","9783642410192"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41019-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}