{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:43Z","timestamp":1759638883384,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T00:00:00Z","timestamp":1403308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,21]]},"DOI":"10.1145\/2612669.2612689","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"118-127","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["LP rounding and combinatorial algorithms for minimizing active and busy time"],"prefix":"10.1145","author":[{"given":"Jessica","family":"Chang","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"Samir","family":"Khuller","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"Koyel","family":"Mukherjee","sequence":"additional","affiliation":[{"name":"Xerox Research Centre India, Bangalore, India"}]}],"member":"320","published-online":{"date-parts":[[2014,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03456-5_12"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1735223.1735245"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109598"},{"key":"e_1_3_2_1_5_1","volume-title":"Scheduling algorithms","author":"Brucker P.","year":"2007","unstructured":"P. Brucker . Scheduling algorithms . Springer , 2007 . P. Brucker. Scheduling algorithms. Springer, 2007."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_26"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972931.2"},{"key":"e_1_3_2_1_8_1","unstructured":"J. Chang S. Khuller and K. Mukherjee. LP rounding and combinatorial algorithms for minimizing active and busy time. http:\/\/www.cs.umd.edu\/~samir\/fv.pdf.  J. Chang S. Khuller and K. Mukherjee. LP rounding and combinatorial algorithms for minimizing active and busy time. http:\/\/www.cs.umd.edu\/~samir\/fv.pdf."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-010-0176-y"},{"key":"e_1_3_2_1_10_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . MIT press , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT press, 2001."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161017"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85451-7_99"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602613_91"},{"key":"e_1_3_2_1_14_1","first-page":"169","volume-title":"Proceedings of FSTTCS","author":"Khandekar R.","year":"2010","unstructured":"R. Khandekar , B. Schieber , H. Shachnai , and T. Tamir . Minimizing busy time in multiple machine real-time scheduling . In Proceedings of FSTTCS , pages 169 -- 180 , 2010 . R. Khandekar, B. Schieber, H. Shachnai, and T. Tamir. Minimizing busy time in multiple machine real-time scheduling. In Proceedings of FSTTCS, pages 169--180, 2010."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40104-6_41"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11590156_12"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.31"},{"key":"e_1_3_2_1_18_1","first-page":"830","volume-title":"Proceedings of the 14th Annual ACM-SIAM SODA","author":"Winkler P.","year":"2003","unstructured":"P. Winkler and L. Zhang . Wavelength assignment and generalized interval graph coloring . In Proceedings of the 14th Annual ACM-SIAM SODA , pages 830 -- 831 , 2003 . P. Winkler and L. Zhang. Wavelength assignment and generalized interval graph coloring. In Proceedings of the 14th Annual ACM-SIAM SODA, pages 830--831, 2003."}],"event":{"name":"SPAA '14: 26th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Prague Czech Republic","acronym":"SPAA '14"},"container-title":["Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612689","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2612669.2612689","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:34Z","timestamp":1750230094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612689"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,21]]},"references-count":18,"alternative-id":["10.1145\/2612669.2612689","10.1145\/2612669"],"URL":"https:\/\/doi.org\/10.1145\/2612669.2612689","relation":{},"subject":[],"published":{"date-parts":[[2014,6,21]]},"assertion":[{"value":"2014-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}