{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:47:06Z","timestamp":1725558426091},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_18","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T07:00:50Z","timestamp":1276153250000},"page":"176-187","source":"Crossref","is-referenced-by-count":1,"title":["Capacitated max -Batching with Interval Graph Compatibilities"],"prefix":"10.1007","author":[{"given":"Tim","family":"Nonner","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"18_CR1","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. Journal of the ACM\u00a045(5), 753\u2013782 (1998)","journal-title":"Journal of the ACM"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Baptiste, P.: Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201906), pp. 364\u2013367 (2006)","DOI":"10.1145\/1109557.1109598"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Korteweg, P., Marchetti-Spaccamela, A., Skutella, M., Stougie, L., Vitaletti, A.: Latency constrained aggregation in sensor networks. In: Proceedings of the 14th Annual European Symposium on Algorithms (ESA\u201906), pp. 88\u201399 (2006)","DOI":"10.1007\/11841036_11"},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0304-3975(95)00057-4","volume":"148","author":"H.L. Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems. part I. Theoretical Computer Science\u00a0148(1), 93\u2013109 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1023669107449","volume":"2","author":"M. Boudhar","year":"2003","unstructured":"Boudhar, M.: Dynamic scheduling on a single batch processing machine with split compatibility graphs. Journal of Mathematical Modelling and Algorithms\u00a02(1), 17\u201335 (2003)","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"18_CR6","unstructured":"Correa, J., Megow, N., Raman, R., Suchan, K.: Cardinality constrained graph partitioning into cliques with submodular costs. In: Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW\u201909), pp. 347\u2013350 (2009)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Even, G., Levi, R., Rawitz, D., Schieber, B., Shahar, S., Sviridenko, M.: Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Transactions on Algorithms\u00a04(3) (2008)","DOI":"10.1145\/1367064.1367074"},{"issue":"5","key":"18_CR8","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.dam.2006.03.039","volume":"156","author":"G. Finke","year":"2008","unstructured":"Finke, G., Jost, V., Queyranne, M., Seb\u00f6, A.: Batch processing with interval graph compatibilities between tasks. Discrete Applied Mathematics\u00a0156(5), 556\u2013568 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1051\/ro:2007024","volume":"41","author":"D. Gijswijt","year":"2007","unstructured":"Gijswijt, D., Jost, V., Queyranne, M.: Clique partitioning of interval graphs with submodular costs on the cliques. RAIRO - Operations Research\u00a041(3), 275\u2013287 (2007)","journal-title":"RAIRO - Operations Research"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1287\/opre.45.6.874","volume":"45","author":"D.S. Hochbaum","year":"1997","unstructured":"Hochbaum, D.S., Laundy, D.: Scheduling semiconductor burn-in operations to minimize total flowtime. Operations Research\u00a045, 874\u2013885 (1997)","journal-title":"Operations Research"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM\u00a032(1), 130\u2013136 (1985)","journal-title":"Journal of the ACM"},{"key":"18_CR12","volume-title":"Computers and Intracability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intracability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Pemmaraju, S.V., Raman, R.: Approximation algorithms for the max-coloring problem. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP\u201905), pp. 1064\u20131075 (2005)","DOI":"10.1007\/11523468_86"},{"key":"18_CR14","unstructured":"Pemmaraju, S.V., Raman, R., Varadarajan, K.: Buffer minimization using max-coloring. In: Proceedings of the 15th annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201904), pp. 562\u2013571 (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:11:13Z","timestamp":1619770273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}