{"id":"https://openalex.org/W2269281743","doi":"https://doi.org/10.1145/2897518.2897572","title":"Lift-and-round to improve weighted completion time on unrelated machines","display_name":"Lift-and-round to improve weighted completion time on unrelated machines","publication_year":2016,"publication_date":"2016-06-10","ids":{"openalex":"https://openalex.org/W2269281743","doi":"https://doi.org/10.1145/2897518.2897572","mag":"2269281743"},"language":"en","primary_location":{"id":"doi:10.1145/2897518.2897572","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2897518.2897572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/227999","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["Eindhoven University of Technology, Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"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":"Aravind Srinivasan","raw_affiliation_strings":["University of Maryland, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046999727","display_name":"Ola Svensson","orcid":"https://orcid.org/0000-0003-2997-1372"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Ola Svensson","raw_affiliation_strings":["EPFL, Switzerland"],"affiliations":[{"raw_affiliation_string":"EPFL, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":8.0429,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.97363195,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"156","last_page":"167"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9959999918937683,"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.8950434923171997},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7531635761260986},{"id":"https://openalex.org/keywords/lift","display_name":"Lift (data mining)","score":0.722334623336792},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6549274921417236},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.518354058265686},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5163154006004333},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4974565804004669},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4834666848182678},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4680739641189575},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41351139545440674},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41177529096603394},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3861522674560547},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35613977909088135},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.28245627880096436},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.09030959010124207},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06203463673591614}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8950434923171997},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7531635761260986},{"id":"https://openalex.org/C139002025","wikidata":"https://www.wikidata.org/wiki/Q3001212","display_name":"Lift (data mining)","level":2,"score":0.722334623336792},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6549274921417236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.518354058265686},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5163154006004333},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4974565804004669},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4834666848182678},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4680739641189575},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41351139545440674},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41177529096603394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3861522674560547},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35613977909088135},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.28245627880096436},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.09030959010124207},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06203463673591614},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/2897518.2897572","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2897518.2897572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:publications/114453f8-f21f-48fa-97f8-aeefa9b0b7b3","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/114453f8-f21f-48fa-97f8-aeefa9b0b7b3","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Srinivasan, A & Svensson, O 2016, Lift-and-round to improve weighted completion time on unrelated machines. in STOC 2016 - Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, Inc., Cambridge, Ma, pp. 156-167, 48th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2016), Cambridge, United States, 19/06/16. https://doi.org/10.1145/2897518.2897572","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/f0adbf15-f1ac-4e5f-8cd5-9e5d7be82d62","is_oa":false,"landing_page_url":"https://arxiv.org/abs/1511.07826","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:infoscience.epfl.ch:227999","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/227999","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:tue:oai:pure.tue.nl:publications/114453f8-f21f-48fa-97f8-aeefa9b0b7b3","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/114453f8-f21f-48fa-97f8-aeefa9b0b7b3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"STOC 2016 - Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 156 - 167","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:227999","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/227999","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1501066815","https://openalex.org/W1504327134","https://openalex.org/W1512148653","https://openalex.org/W1556839242","https://openalex.org/W1668808034","https://openalex.org/W1903284337","https://openalex.org/W1960237771","https://openalex.org/W1965193466","https://openalex.org/W1969481001","https://openalex.org/W1978593916","https://openalex.org/W1988328380","https://openalex.org/W1992678640","https://openalex.org/W2001927417","https://openalex.org/W2006905044","https://openalex.org/W2007604989","https://openalex.org/W2009636784","https://openalex.org/W2013170874","https://openalex.org/W2015033265","https://openalex.org/W2015231501","https://openalex.org/W2026040656","https://openalex.org/W2026608063","https://openalex.org/W2040155008","https://openalex.org/W2040475938","https://openalex.org/W2044380699","https://openalex.org/W2056273707","https://openalex.org/W2080167233","https://openalex.org/W2081798943","https://openalex.org/W2085325317","https://openalex.org/W2102201348","https://openalex.org/W2102588682","https://openalex.org/W2104144451","https://openalex.org/W2123976299","https://openalex.org/W2135932424","https://openalex.org/W2145469812","https://openalex.org/W2148204686","https://openalex.org/W3005451364","https://openalex.org/W3186546642","https://openalex.org/W4293781866","https://openalex.org/W6647086195","https://openalex.org/W6678404179"],"related_works":["https://openalex.org/W3100114454","https://openalex.org/W2507810539","https://openalex.org/W2035016254","https://openalex.org/W1600160158","https://openalex.org/W2137277194","https://openalex.org/W2031277014","https://openalex.org/W4287593987","https://openalex.org/W2561769964","https://openalex.org/W4287552035","https://openalex.org/W3112213682"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,14,33,51,57],"problem":[3],"of":[4,16,36,66],"scheduling":[5],"jobs":[6],"on":[7],"unrelated":[8],"machines":[9],"so":[10],"as":[11,56],"to":[12],"minimize":[13],"sum":[15],"weighted":[17],"completion":[18],"times.":[19],"Our":[20],"main":[21],"result":[22],"is":[23,54],"a":[24,44,71],"(3/2-c)-approximation":[25],"algorithm":[26],"for":[27,50],"some":[28],"fixed":[29],"c>0,":[30],"improving":[31],"upon":[32],"long-standing":[34],"bound":[35],"3/2.":[37,67],"To":[38],"do":[39],"this,":[40],"we":[41,69],"first":[42],"introduce":[43],"new":[45,72],"lift-and-project":[46],"based":[47],"SDP":[48],"relaxation":[49],"problem.":[52],"This":[53],"necessary":[55],"previous":[58],"convex":[59],"programming":[60],"relaxations":[61],"have":[62],"an":[63,78],"integrality":[64],"gap":[65],"Second,":[68],"give":[70],"general":[73],"bipartite-rounding":[74],"procedure":[75],"that":[76],"produces":[77],"assignment":[79],"with":[80],"certain":[81],"strong":[82],"negative":[83],"correlation":[84],"properties.":[85]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":3}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}