{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:07:59Z","timestamp":1761487679763},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_30","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"315-326","source":"Crossref","is-referenced-by-count":4,"title":["Finding Total Unimodularity in Optimization Problems Solved by Linear Programs"],"prefix":"10.1007","author":[{"given":"Christoph","family":"D\u00fcrr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathilde","family":"Hurand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","volume-title":"Network Flows : Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Albers, S., B\u00fcttner, M.: Integrated prefetching and caching in single and parallel disk systems. Information and Computation\u00a0(198), 24\u201339 (2005)","DOI":"10.1016\/j.ic.2005.01.003"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Albers, S., Garg, N., Leonardi, S.: Minimizing stall time in single and parallel disk systems. Journal of the ACM\u00a0(47), 969\u2013986 (2000)","DOI":"10.1145\/355541.355542"},{"issue":"4","key":"30_CR4","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1023\/A:1024012811536","volume":"6","author":"P. Baptiste","year":"2003","unstructured":"Baptiste, P., Schieber, B.: A note on scheduling tall\/small multiprocessor tasks with unit processing time to minimize maximum tardiness. Journal of Scheduling\u00a06(4), 395\u2013404 (2003)","journal-title":"Journal of Scheduling"},{"key":"30_CR5","unstructured":"Brucker, P., Kravchenko, S.: Scheduling jobs with equal processing times and time windows on identical parallel machines. Osnabr\u00fccker Schriften zur Mathematik H 257, Universit\u00e4t Osnabr\u00fcck. Fachbereich Mathematik\/Informatik. Journal of Scheduling (to appear, 2005)"},{"key":"30_CR6","unstructured":"Cao, P., Felten, E.W., Karlin, A.R., Li, K.: Implementation and performance of integrated application-controlled caching, prefetching and disk scheduling. ACM Transaction of Computer Systems, 188\u2013196 (1995)"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"J.B. Orlin","year":"1993","unstructured":"Orlin, J.B.: A faster strongly polynomial algorithm for the minimum cost flow problem. Operations Research\u00a041, 338\u2013350 (1993)","journal-title":"Operations Research"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Simons, B.: A fast algorithm for single processor scheduling. In: Proceedings IEEE 19th Annual Symposium on Foundations of Computer Science (FOCS 1978), pp. 246\u2013252 (1978)","DOI":"10.1109\/SFCS.1978.4"},{"issue":"4","key":"30_CR9","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1137\/0218048","volume":"18","author":"B. Simons","year":"1989","unstructured":"Simons, B., Warmuth, M.: A fast algorithm for multiprocessor scheduling of unit-length jobs. SIAM Journal on Computing\u00a018(4), 690\u2013710 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"30_CR10","series-title":"Algorithms and Complexity","volume-title":"HandBook of Theoretical Computer Science","author":"J. Leeuwen van","year":"1990","unstructured":"van Leeuwen, J.: HandBook of Theoretical Computer Science. Algorithms and Complexity, vol.\u00a0A. Elsevier, Amsterdam (1990)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:40:29Z","timestamp":1605642029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11841036_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}