{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:46:20Z","timestamp":1770993980119,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540422877","type":"print"},{"value":"9783540482246","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_70","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"862-874","source":"Crossref","is-referenced-by-count":15,"title":["The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1nos","family":"Csirik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csan\u00e1d","family":"Imreh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Noga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Sgall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"70_CR1","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u0151tschel","year":"1981","unstructured":"M. Gr\u0151tschel, L. Lov\u00e1sz, AND A. Schrijver [1981]. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169\u2013197.","journal-title":"Combinatorica"},{"key":"70_CR2","unstructured":"S. Irani AND V. Leung [1997]. Probabilistic analysis for scheduling with conflicts, Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 286\u2013295."},{"key":"70_CR3","unstructured":"S. Irani AND V. Leung [1996]. Scheduling with conflicts, and applications to traffic signal control, Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 85\u201394."},{"key":"70_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/inco.1997.2677","volume":"140","author":"A. Bar-Noy","year":"1998","unstructured":"A. Bar-Noy, M. Bellare, M.M. Halld\u00f3rsson, H. Shachnai AND T. Tamir [1998]. On chromatic sums and distributed resource allocation. Information and Computation 140, 183\u2013202.","journal-title":"Information and Computation"},{"key":"70_CR5","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1006\/jagm.1998.0938","volume":"28","author":"A. Bar-Noy","year":"1998","unstructured":"A. Bar-Noy AND G. Kortsarz [1998]. Minimum color sum of bipartite graphs, Journal of Algorithms 28, 339\u2013365.","journal-title":"Journal of Algorithms"},{"key":"70_CR6","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"C. Lund AND M. Yannakakis [1994]. On the hardness of approximating minimization problems. Journal of the ACM 41, 960\u2013981.","journal-title":"Journal of the ACM"},{"key":"70_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0304-3975(94)90151-1","volume":"130","author":"R. Motwani","year":"1994","unstructured":"R. Motwani, S. Philips AND E. Torng [1994]. Non-clairvoyant scheduling, Theoretical Computer Science 130, 17\u201347.","journal-title":"Theoretical Computer Science"},{"key":"70_CR8","doi-asserted-by":"crossref","unstructured":"E. Kubicka AND A.J. Schwenk [1989]. An introduction to chromatic sums, Proc. ACM Computer Science Conference, 39\u201345.","DOI":"10.1145\/75427.75430"},{"key":"70_CR9","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"N.A. Lynch [1996]. Distributed Algorithms. Morgan Kauffman Publishers, San Francisco, California, 1996."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_70","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T19:08:32Z","timestamp":1551035312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_70","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}