{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:04:20Z","timestamp":1737435860136,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_2","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:32:26Z","timestamp":1186741946000},"page":"14-14","source":"Crossref","is-referenced-by-count":2,"title":["Approximation Algorithms for Fractional Covering and Packing Problems, and Applications"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1287\/moor.21.2.321","volume":"21","author":"M.D. Grigoriadis","year":"1996","unstructured":"M.D. Grigoriadis and L.G. Khachiyan, Coordination complexity of parallel pricedirective decomposition, Mathematics of Operations Research 21 (1996), 321\u2013340.","journal-title":"Mathematics of Operations Research"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"M.D. Grigoriadis, L.G. Khachiyan, L. Porkolab, and J. Villavicencio: Approximate max-min resource sharing for structured concave optimization, SIAM Journal on Optimization, to appear.","DOI":"10.1137\/S1052623499358689"},{"key":"2_CR3","unstructured":"K. Jansen and L. Porkolab, Linear-time approximation schemes for scheduling malleable parallel tasks, Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (1999), 490\u2013498."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"K. Jansen and L. Porkolab, Improved approximation schemes for scheduling unrelated parallel machines, Proceedings of the 31st ACM Symposium on the Theory of Computing (1999), 408\u2013417.","DOI":"10.1145\/301250.301361"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"K. Jansen and L. Porkolab: On resource constrained scheduling: polynomial time approximation schemes, submitted for publication (2001).","DOI":"10.1007\/3-540-47867-1_24"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"C. Kenyon, and E. Remila: Approximate strip packing, 37th Annual IEEE Symposium on Foundations of Computer Science, FOCS 96, 31\u201336, and Mathematics of Operations Research, to appear.","DOI":"10.1109\/SFCS.1996.548461"},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"20","author":"S.A. Plotkin","year":"1995","unstructured":"S.A. Plotkin, D.B. Shmoys, and E. Tardos: Fast approximation algorithms for fractional packing and covering problems, Mathematics of Operations Research 20 (1995), 257\u2013301.","journal-title":"Mathematics of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T07:27:35Z","timestamp":1737358055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}