{"id":"https://openalex.org/W2951450242","doi":"https://doi.org/10.1137/19m128257x","title":"A Quasi-Polynomial Approximation for the Restricted Assignment Problem","display_name":"A Quasi-Polynomial Approximation for the Restricted Assignment Problem","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W2951450242","doi":"https://doi.org/10.1137/19m128257x","mag":"2951450242"},"language":"en","primary_location":{"id":"doi:10.1137/19m128257x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m128257x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1701.07208","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5074555680","display_name":"Lars Rohwedder","orcid":"https://orcid.org/0000-0002-9434-4589"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Lars Rohwedder","raw_affiliation_strings":["University of Kiel,"],"raw_orcid":"https://orcid.org/0000-0002-9434-4589","affiliations":[{"raw_affiliation_string":"University of Kiel,","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00620989,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"49","issue":"6","first_page":"1083","last_page":"1108"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"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/constructive","display_name":"Constructive","score":0.7843780517578125},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.52567058801651},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.518773078918457},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.49418261647224426},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4872697591781616},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.48165619373321533},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4704752564430237},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4675774872303009},{"id":"https://openalex.org/keywords/constructive-proof","display_name":"Constructive proof","score":0.4505692720413208},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.44059643149375916},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.419086217880249},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3545498251914978},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3397846221923828},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33033889532089233},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08029651641845703}],"concepts":[{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.7843780517578125},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.52567058801651},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.518773078918457},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.49418261647224426},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4872697591781616},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.48165619373321533},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4704752564430237},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4675774872303009},{"id":"https://openalex.org/C202854965","wikidata":"https://www.wikidata.org/wiki/Q3044470","display_name":"Constructive proof","level":2,"score":0.4505692720413208},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.44059643149375916},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.419086217880249},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3545498251914978},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3397846221923828},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33033889532089233},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08029651641845703},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/19m128257x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m128257x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1701.07208","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1701.07208","pdf_url":"https://arxiv.org/pdf/1701.07208","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"mag:2951450242","is_oa":true,"landing_page_url":"https://www.arxiv.org/abs/1701.07208","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:infoscience.epfl.ch:282705","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/282705","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":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"research article"},{"id":"doi:10.48550/arxiv.1701.07208","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1701.07208","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1701.07208","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1701.07208","pdf_url":"https://arxiv.org/pdf/1701.07208","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":[],"awards":[{"id":"https://openalex.org/G8468413247","display_name":null,"funder_award_id":"JA 612/15-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1589729468","https://openalex.org/W1899379166","https://openalex.org/W1978593916","https://openalex.org/W2001927417","https://openalex.org/W2006905044","https://openalex.org/W2102201348","https://openalex.org/W2135932424","https://openalex.org/W2168581227","https://openalex.org/W2280590529","https://openalex.org/W2555955801","https://openalex.org/W2556703148","https://openalex.org/W2573293934","https://openalex.org/W2585975065"],"related_works":["https://openalex.org/W2585975065","https://openalex.org/W2769731375","https://openalex.org/W2087490340","https://openalex.org/W1504892637","https://openalex.org/W1608772366","https://openalex.org/W2053393096","https://openalex.org/W1594553832","https://openalex.org/W1547653952","https://openalex.org/W1501441759","https://openalex.org/W1539677952","https://openalex.org/W1539745397","https://openalex.org/W3177317318","https://openalex.org/W1994355374","https://openalex.org/W2171280220","https://openalex.org/W1620816389","https://openalex.org/W2953269844","https://openalex.org/W2162500852","https://openalex.org/W2952626533","https://openalex.org/W2950317804","https://openalex.org/W2156747735"],"abstract_inverted_index":{"The":[0],"Restricted":[1],"Assignment":[2],"problem":[3,63],"is":[4,56],"a":[5,46,50],"prominent":[6],"special":[7],"case":[8],"of":[9,70],"Scheduling":[10],"on":[11,30,65],"Unrelated":[12],"Parallel":[13],"Machines.":[14],"For":[15],"the":[16,22,27,41,57,66],"strongest":[17],"known":[18],"linear":[19],"programming":[20],"relaxation,":[21],"configuration":[23],"LP,":[24],"we":[25,44],"improve":[26],"nonconstructive":[28],"bound":[29],"its":[31],"integrality":[32],"gap":[33],"from":[34],"1.9412":[35],"to":[36],"1.8334":[37],"and":[38],"significantly":[39],"simplify":[40],"proof.":[42],"Then":[43],"give":[45],"constructive":[47],"variant,":[48],"yielding":[49],"1.8334-approximation":[51],"in":[52],"quasi-polynomial":[53,59],"time.":[54],"This":[55],"first":[58],"algorithm":[60],"for":[61],"this":[62],"improving":[64],"long-standing":[67],"approximation":[68],"rate":[69],"2.":[71]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}