{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:32:30Z","timestamp":1725564750068},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540204527"},{"type":"electronic","value":"9783540398905"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39890-5_3","type":"book-chapter","created":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T21:16:57Z","timestamp":1283548617000},"page":"23-33","source":"Crossref","is-referenced-by-count":7,"title":["Minimum Flow Time Graph Ordering"],"prefix":"10.1007","author":[{"given":"Claudio","family":"Arbib","sequence":"first","affiliation":[]},{"given":"Michele","family":"Flammini","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Marinelli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0166-218X(99)00139-0","volume":"99","author":"C. Arbib","year":"2000","unstructured":"Arbib, C., Flammini, M., Nardelli, E.: How to Survive while Visiting a Graph. Discrete Applied Mathematics\u00a099, 279\u2013293 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/PL00011381","volume":"88","author":"R. Bornd\u00f6rfer","year":"2000","unstructured":"Bornd\u00f6rfer, R., Weismantel, R.: Set Packing Relaxations of Some Integer Programs. Mathematical Programming\u00a088(3), 425\u2013450 (2000)","journal-title":"Mathematical Programming"},{"key":"3_CR3","unstructured":"Dyckhoff, H., Scheithauer, G., Terno, J.: Cutting and Packing: an Annotated Bibliography, ibl@ibl.RWTH-aachen.de (1996)"},{"key":"3_CR4","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-completeness, Freeman & Co., S. Francisco (1979)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some Simplified NP-complete Problems. Theoretical Computer Science\u00a01, 237\u2013267 (1976)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: A Cutting Plane Algorithm for the Linear Ordering Problem. Operations Research\u00a032(6), 1195\u20131220 (1984)","journal-title":"Operations Research"},{"key":"3_CR7","volume-title":"Scheduling: Theory Algorithms and Systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M.: Scheduling: Theory Algorithms and Systems. Prentice Hall, Englewood Cliffs (1995)"},{"key":"3_CR8","unstructured":"Silvestre, J.P.: Layout Problems, Ph.D. Thesis (2001)"}],"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\/978-3-540-39890-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T18:41:28Z","timestamp":1553020888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39890-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204527","9783540398905"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39890-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}