{"id":"https://openalex.org/W2463505734","doi":"https://doi.org/10.1145/2935764.2935809","title":"Brief Announcement","display_name":"Brief Announcement","publication_year":2016,"publication_date":"2016-07-08","ids":{"openalex":"https://openalex.org/W2463505734","doi":"https://doi.org/10.1145/2935764.2935809","mag":"2463505734"},"language":"en","primary_location":{"id":"doi:10.1145/2935764.2935809","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2935764.2935809","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","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/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":true,"raw_author_name":"Samir Khuller","raw_affiliation_strings":["University of Maryland, College Park, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054974601","display_name":"Manish Purohit","orcid":"https://orcid.org/0000-0002-8650-2022"},"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":"Manish Purohit","raw_affiliation_strings":["University of Maryland, College Park, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042716179"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":4.1817,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.94367108,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"239","last_page":"240"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.8205827474594116},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6442288160324097},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6158331036567688},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5996891260147095},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.4799242615699768},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.4537036120891571},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4319351613521576},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.377032071352005},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3239021897315979}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.8205827474594116},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6442288160324097},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6158331036567688},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5996891260147095},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.4799242615699768},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.4537036120891571},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4319351613521576},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.377032071352005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3239021897315979},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2935764.2935809","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2935764.2935809","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W169464267","https://openalex.org/W1545728916","https://openalex.org/W1982055457","https://openalex.org/W2013932952","https://openalex.org/W2016432178","https://openalex.org/W2062428974","https://openalex.org/W2082521007","https://openalex.org/W2091520147","https://openalex.org/W2092252886","https://openalex.org/W2149939304"],"related_works":["https://openalex.org/W2163115662","https://openalex.org/W2888826740","https://openalex.org/W2165420145","https://openalex.org/W2463505734","https://openalex.org/W2005018956","https://openalex.org/W1534072310","https://openalex.org/W2099734427","https://openalex.org/W2521479096","https://openalex.org/W2092288198","https://openalex.org/W2035994564"],"abstract_inverted_index":{"Co-flow":[0],"scheduling":[1,23],"is":[2],"a":[3,52,56,73,89,93],"recent":[4],"networking":[5],"abstraction":[6],"introduced":[7],"to":[8,28,71],"capture":[9],"application-level":[10],"communication":[11],"patterns":[12],"in":[13],"datacenters.":[14],"In":[15,63],"this":[16,49,64],"paper,":[17,65],"we":[18,66,87],"consider":[19],"the":[20,30,43,78],"offline":[21],"co-flow":[22],"problem":[24,50],"with":[25,51],"release":[26,83],"times":[27,84],"minimize":[29],"total":[31],"weighted":[32],"completion":[33],"time.":[34],"Recently,":[35],"Qiu,":[36],"Stein":[37],"and":[38,55,92],"Zhong":[39],"(SPAA,":[40],"2015)":[41],"obtained":[42],"first":[44],"constant":[45],"approximation":[46],"algorithms":[47],"for":[48],"deterministic":[53,74,90],"67/3-approximation":[54],"randomized":[57,94],"(9":[58],"+":[59],"16\u221a2)/3":[60],"\u2245":[61,96],"16.54-approximation.":[62],"improve":[67],"upon":[68],"their":[69],"algorithm":[70],"yield":[72],"12-approximation":[75],"algorithm.":[76],"For":[77],"special":[79],"case":[80],"when":[81],"all":[82],"are":[85],"zero,":[86],"obtain":[88],"8-approximation":[91],"(3+2\u221a2)":[95],"5.83-approximation.":[97]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-07-22T00:00:00"}