{"id":"https://openalex.org/W2140320442","doi":"https://doi.org/10.1145/2612669.2612689","title":"LP rounding and combinatorial algorithms for minimizing active and busy time","display_name":"LP rounding and combinatorial algorithms for minimizing active and busy time","publication_year":2014,"publication_date":"2014-06-21","ids":{"openalex":"https://openalex.org/W2140320442","doi":"https://doi.org/10.1145/2612669.2612689","mag":"2140320442"},"language":"en","primary_location":{"id":"doi:10.1145/2612669.2612689","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612689","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102935425","display_name":"Jessica Chang","orcid":"https://orcid.org/0000-0002-8012-9490"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jessica Chang","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042716179","display_name":"Samir Khuller","orcid":"https://orcid.org/0000-0002-5408-8023"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samir Khuller","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039773878","display_name":"Koyel Mukherjee","orcid":"https://orcid.org/0000-0002-7240-1917"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Koyel Mukherjee","raw_affiliation_strings":["Xerox Research Centre India, Bangalore, India"],"affiliations":[{"raw_affiliation_string":"Xerox Research Centre India, Bangalore, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102935425"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":2.8777,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.92010816,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"118","last_page":"127"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.8841222524642944},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6559466123580933},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6129677891731262}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8841222524642944},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6559466123580933},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6129677891731262},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2612669.2612689","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612689","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.431.7391","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.431.7391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/~samir/grant/spaa14.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W36004361","https://openalex.org/W1517817722","https://openalex.org/W1578512030","https://openalex.org/W1587883041","https://openalex.org/W1590696547","https://openalex.org/W1619986053","https://openalex.org/W1770425921","https://openalex.org/W1996183272","https://openalex.org/W1999414334","https://openalex.org/W2014008637","https://openalex.org/W2015054838","https://openalex.org/W2092288295","https://openalex.org/W2122882715","https://openalex.org/W2139090343","https://openalex.org/W2149206167","https://openalex.org/W2165377422","https://openalex.org/W2246955633","https://openalex.org/W2341350247","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4210727445","https://openalex.org/W4240119221","https://openalex.org/W6704141741","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2021921500","https://openalex.org/W1981299587","https://openalex.org/W303980170","https://openalex.org/W2351491280","https://openalex.org/W2386767533","https://openalex.org/W2106652828","https://openalex.org/W2371447506","https://openalex.org/W2333698505","https://openalex.org/W2462268341","https://openalex.org/W1981434342"],"abstract_inverted_index":{"We":[0,177],"consider":[1,189],"fundamental":[2],"scheduling":[3],"problems":[4],"motivated":[5],"by":[6],"energy":[7],"issues.":[8],"In":[9],"this":[10,103,111,127,175,216],"framework,":[11],"we":[12,91,108,143,188],"are":[13],"given":[14,48],"a":[15,44,54,72,94,100,113,134,170,179,185,196],"set":[16],"of":[17,126,149,155],"jobs,":[18,77],"each":[19,152],"with":[20],"release":[21],"time,":[22],"deadline":[23],"and":[24,107,169,198],"required":[25],"processing":[26],"length.":[27],"The":[28,50,67],"jobs":[29,39],"need":[30],"to":[31,62,70,112],"be":[32,41],"scheduled":[33],"so":[34],"that":[35,93,183,207,220],"at":[36,46,87],"most":[37],"g":[38,210],"can":[40],"running":[42],"on":[43,137],"machine":[45,55,139],"any":[47],"time.":[49,66,82],"duration":[51],"for":[52,75,122,145,174],"which":[53],"is":[56,60,69,85,105,121,141,159,172,184,205,211,221],"active":[57,65,81],"(i.e.,":[58],"\"on\")":[59],"referred":[61],"as":[63,161],"its":[64],"goal":[68],"find":[71],"feasible":[73,96,135],"schedule":[74,97,136],"all":[76],"minimizing":[78],"the":[79,123,162,167,190],"total":[80],"When":[83],"preemption":[84],"allowed":[86],"integer":[88],"time":[89,164,193],"points,":[90],"show":[92],"minimal":[95],"already":[98],"yields":[99,217],"3-approximation":[101],"(and":[102],"bound":[104],"tight)":[106],"further":[109],"improve":[110],"2-approximation":[114],"via":[115],"LP":[116],"rounding.":[117],"Our":[118],"second":[119],"contribution":[120],"non-preemptive":[124],"version":[125],"problem.":[128,176],"However,":[129],"since":[130],"even":[131],"asking":[132],"if":[133],"one":[138],"exists":[140],"NP-hard,":[142],"allow":[144],"an":[146,218],"unbounded":[147,203],"number":[148],"virtual":[150],"machines,":[151],"having":[153],"capacity":[154],"g.":[156],"This":[157],"problem":[158,165],"known":[160,173],"busy":[163,192],"in":[166],"literature":[168],"4-approximation":[171],"develop":[178],"new":[180],"combinatorial":[181],"algorithm":[182,201,219],"$3$-approximation.":[186],"Furthermore,":[187],"preemptive":[191],"problem,":[194],"giving":[195],"simple":[197],"exact":[199],"greedy":[200],"when":[202],"parallelism":[204],"allowed,":[206],"is,":[208],"where":[209],"unbounded.":[212],"For":[213],"arbitrary":[214],"g,":[215],"2$-approximate.":[222]},"counts_by_year":[{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}