{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:53:21Z","timestamp":1762210401228},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_20","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"227-238","source":"Crossref","is-referenced-by-count":26,"title":["The Computational Complexity of Delay Management"],"prefix":"10.1007","author":[{"given":"Michael","family":"Gatto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riko","family":"Jacob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leon","family":"Peeters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anita","family":"Sch\u00f6bel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","first-page":"785","volume-title":"Computers in Railways IX","author":"C. Biederbick","year":"2004","unstructured":"Biederbick, C., Suhl, L.: Improving the quality of railway dispatching tasks via agent-based simulation. In: Computers in Railways IX, pp. 785\u2013795. WIT Press, Southampton (2004)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-27810-8_18","volume-title":"Algorithm Theory - SWAT 2004","author":"M. Gatto","year":"2004","unstructured":"Gatto, M., Glaus, B., Jacob, R., Peeters, L., Widmayer, P.: Railway delay management: Exploring its algorithmic complexity. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 199\u2013211. Springer, Heidelberg (2004)"},{"key":"20_CR3","volume-title":"Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness. Freeman and Company, New York (1979)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Gatto, M., Jacob, R., Peeters, L., Sch\u00f6bel, A.: The computational complexity of delay management. Technical Report 456, ETH Zurich (2004)","DOI":"10.1007\/11604686_20"},{"key":"20_CR5","unstructured":"Gatto, M., Jacob, R., Peeters, L., Widmayer, P.: On-line delay management on a single line. In: Proc. Algorithmic Methods and Models for Optimization of Railways (ATMOS), LNCS. Springer, Heidelberg (2004) (To appear)"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. Journal of ACM\u00a048, 798\u2013859 (2001)","journal-title":"Journal of ACM"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1287\/trsc.15.1.62","volume":"15","author":"C. Hendrickson","year":"1981","unstructured":"Hendrickson, C., Kocur, G.: Schedule delay and departure time decisions in a deterministic model. Transportation Science\u00a015, 62\u201377 (1981)","journal-title":"Transportation Science"},{"key":"20_CR8","unstructured":"Megyeri, C.: Bicriterial delay management. Konstanzer Schriften in Mathematik und Informatik 198, University of Konstanz (2004)"},{"key":"20_CR9","first-page":"307","volume":"15","author":"S. Poljak","year":"1974","unstructured":"Poljak, S.: A note on the stable sets and coloring of graphs. Comment. Math. Univ. Carolin.\u00a015, 307\u2013309 (1974)","journal-title":"Comment. Math. Univ. Carolin."},{"key":"20_CR10","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, 425\u2013440 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Sch\u00f6bel, A.: A model for the delay management problem based on mixed-integer-programming. In: Zaroliagis, C. (ed.). Electronic Notes in Theoretical Computer Science, vol.\u00a050. Elsevier, Amsterdam (2001)","DOI":"10.1016\/S1571-0661(04)00160-4"},{"key":"20_CR12","unstructured":"Sch\u00f6bel, A.: Customer-oriented optimization in public transportation. Habilitation Thesis, University of Kaiserslautern (2003) (To appear)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11604686_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:21Z","timestamp":1619507061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11604686_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}