{"id":"https://openalex.org/W2808849040","doi":"https://doi.org/10.1145/3210377.3210659","title":"Brief Announcement","display_name":"Brief Announcement","publication_year":2018,"publication_date":"2018-07-11","ids":{"openalex":"https://openalex.org/W2808849040","doi":"https://doi.org/10.1145/3210377.3210659","mag":"2808849040"},"language":"en","primary_location":{"id":"doi:10.1145/3210377.3210659","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210659","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210659","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210659","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071407490","display_name":"Saurabh Kumar","orcid":"https://orcid.org/0009-0005-4594-1597"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Saurabh Kumar","raw_affiliation_strings":["Google, Mountain View, CA, USA"],"affiliations":[{"raw_affiliation_string":"Google, Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","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"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071407490"],"corresponding_institution_ids":["https://openalex.org/I1291425158"],"apc_list":null,"apc_paid":null,"fwci":0.7817,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.75570166,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"347","last_page":"349"},"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.9990000128746033,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.8176693320274353},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7111238241195679},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5557917356491089},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5471134185791016},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5371160507202148},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4702067971229553},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4577021598815918},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.439728319644928},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42978203296661377},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4102792739868164},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35176825523376465},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21147260069847107},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.1114254891872406},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08734893798828125}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8176693320274353},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7111238241195679},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5557917356491089},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5471134185791016},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5371160507202148},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4702067971229553},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4577021598815918},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.439728319644928},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42978203296661377},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4102792739868164},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35176825523376465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21147260069847107},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1114254891872406},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08734893798828125},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3210377.3210659","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210659","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210659","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3210377.3210659","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210659","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210659","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.5799999833106995,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G180372331","display_name":null,"funder_award_id":"CNS1560193","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G835337900","display_name":"REU Site: CAAR: Combinatorics and Algorithms Applied to Real Problems","funder_award_id":"1560193","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2808849040.pdf","grobid_xml":"https://content.openalex.org/works/W2808849040.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W36004361","https://openalex.org/W1970095041","https://openalex.org/W2049181186","https://openalex.org/W2060983467","https://openalex.org/W2140320442","https://openalex.org/W2484473493","https://openalex.org/W2592348879"],"related_works":["https://openalex.org/W4220780102","https://openalex.org/W2410881844","https://openalex.org/W3196334750","https://openalex.org/W1502401885","https://openalex.org/W2004257129","https://openalex.org/W2116281088","https://openalex.org/W2357551824","https://openalex.org/W2019368960","https://openalex.org/W2016668641","https://openalex.org/W2069464471"],"abstract_inverted_index":{"In":[0],"this":[1],"note,":[2],"we":[3,15,63],"give":[4],"a":[5,18,41,60,86],"simple":[6],"2":[7],"approximation":[8],"for":[9],"the":[10,65,67,72,78,81],"active":[11,73],"time":[12,56,66],"problem":[13],"-":[14],"are":[16],"given":[17,54],"set":[19],"of":[20,80],"pre-emptible":[21],"jobs,":[22],"each":[23],"with":[24],"an":[25],"integral":[26,55],"release":[27],"time,":[28],"deadline":[29],"and":[30],"required":[31],"processing":[32],"length.":[33],"The":[34],"jobs":[35],"need":[36],"to":[37],"be":[38],"scheduled":[39],"on":[40,70],"machine":[42,68],"that":[43,62],"can":[44],"process":[45],"at":[46,52],"most":[47],"g":[48],"distinct":[49],"job":[50],"units":[51],"any":[53],"slot,":[57],"in":[58],"such":[59],"way":[61],"minimize":[64],"is":[69],"i.e":[71],"time.":[74],"Our":[75],"algorithm":[76],"matches":[77],"state":[79],"art":[82],"bound":[83],"obtained":[84],"by":[85],"significantly":[87],"more":[88],"involved":[89],"LP":[90],"rounding":[91],"scheme.":[92]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2018-06-29T00:00:00"}