{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:57:09Z","timestamp":1787320629784,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540729136","type":"print"},{"value":"9783540729143","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72914-3_20","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T05:37:26Z","timestamp":1182836246000},"page":"227-239","source":"Crossref","is-referenced-by-count":3,"title":["The Ferry Cover Problem"],"prefix":"10.1007","author":[{"given":"Michael","family":"Lampis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Valia","family":"Mitsou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"20_CR1","first-page":"13","volume-title":"Proc. 33rd IEEE annual Symposium on Foundations of Computer Science (FOCS)","author":"S. Arora","year":"1992","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and intractability of approximation problems. In: Proc. 33rd IEEE annual Symposium on Foundations of Computer Science (FOCS), pp. 13\u201322. IEEE Computer Society Press, Los Alamitos (1992)"},{"key":"20_CR2","unstructured":"Bornd\u00f6rfer, R., Gr\u00f6tschel, M., L\u00f6bel, A.: Alcuin\u2019s transportation problems and integer programming (1995)"},{"key":"20_CR3","volume-title":"Computers and Intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. W.\u00a0H. Freeman and Co., New York, NY (1979)"},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P. Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of h-coloring. J. Comb. Theory Ser. B.\u00a048(1), 92\u2013110 (1990)","journal-title":"J. Comb. Theory Ser. B"},{"key":"20_CR5","volume-title":"Computational Complexity","author":"E. Petrank","year":"1994","unstructured":"Petrank, E.: The hardness of approximation: Gap location. In: Computational Complexity, vol.\u00a04, Springer, Heidelberg (1994)"},{"key":"20_CR6","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72914-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:53:54Z","timestamp":1558259634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72914-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540729136","9783540729143"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72914-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}