{"id":"https://openalex.org/W1589729468","doi":"https://doi.org/10.1145/2818695","title":"Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation","display_name":"Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation","publication_year":2015,"publication_date":"2015-11-17","ids":{"openalex":"https://openalex.org/W1589729468","doi":"https://doi.org/10.1145/2818695","mag":"1589729468"},"language":"en","primary_location":{"id":"doi:10.1145/2818695","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2818695","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/219873","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077407646","display_name":"Luk\u00e1\u0161 Pol\u00e1\u010dek","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Luk\u00e1\u0161 Pol\u00e1\u010dek","raw_affiliation_strings":["KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"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/I174424907","display_name":"Laboratoire d'Informatique Fondamentale de Lille","ror":"https://ror.org/05rhg0h08","country_code":"FR","type":"facility","lineage":["https://openalex.org/I174424907"]},{"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","FR"],"is_corresponding":false,"raw_author_name":"Ola Svensson","raw_affiliation_strings":["EPFL, Switzerland","EPFL, SWITZERLAND"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL, Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"EPFL, SWITZERLAND","institution_ids":["https://openalex.org/I174424907","https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7646,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.84819064,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"12","issue":"2","first_page":"1","last_page":"13"},"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.9998999834060669,"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.9998999834060669,"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.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/T10237","display_name":"Cryptography and Data Security","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/time-complexity","display_name":"Time complexity","score":0.5249407291412354},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5226366519927979},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.5194737315177917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5142568945884705},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4810102880001068},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46813616156578064},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46734291315078735},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4598224461078644},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4101094603538513},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37467607855796814},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34431275725364685},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32676762342453003},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09303662180900574}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5249407291412354},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5226366519927979},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5194737315177917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5142568945884705},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4810102880001068},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46813616156578064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46734291315078735},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4598224461078644},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4101094603538513},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37467607855796814},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34431275725364685},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32676762342453003},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09303662180900574},{"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":2,"locations":[{"id":"doi:10.1145/2818695","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2818695","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:infoscience.epfl.ch:219873","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/219873","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"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:219873","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/219873","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1488906711","https://openalex.org/W1978593916","https://openalex.org/W1989453388","https://openalex.org/W1992678640","https://openalex.org/W1995275762","https://openalex.org/W2001927417","https://openalex.org/W2035337032","https://openalex.org/W2044380699","https://openalex.org/W2068859584","https://openalex.org/W2102201348","https://openalex.org/W2123976299","https://openalex.org/W2126307323","https://openalex.org/W2135932424","https://openalex.org/W2154014787","https://openalex.org/W2569854318","https://openalex.org/W2736305340","https://openalex.org/W4389615669"],"related_works":["https://openalex.org/W1759995226","https://openalex.org/W2962917430","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W4299801389","https://openalex.org/W2089134982","https://openalex.org/W2028468530","https://openalex.org/W1903284337"],"abstract_inverted_index":{"The":[0],"restricted":[1,10],"max-min":[2],"fair":[3],"allocation":[4],"problem":[5,112],"(also":[6],"known":[7,72],"as":[8],"the":[9,21,49,66,94,120,128,146,169,176,182,191],"Santa":[11],"Claus":[12],"problem)":[13],"is":[14,70,92,99,194],"one":[15],"of":[16,24,55,106,131],"few":[17],"problems":[18],"that":[19,39,87,141,172],"enjoys":[20],"intriguing":[22],"status":[23],"having":[25],"a":[26,40,53,77,80,104,115,138],"better":[27],"estimation":[28],"algorithm":[29,118,193],"than":[30],"approximation":[31,117],"algorithm.":[32],"Indeed,":[33],"Asadpour":[34,132],"et":[35,133],"al.":[36,134],"[2012]":[37,135],"proved":[38],"certain":[41],"configuration":[42,179],"LP":[43,180],"can":[44],"be":[45],"used":[46],"to":[47,74,158],"estimate":[48],"optimal":[50],"value":[51],"within":[52],"factor":[54],"1/(4":[56],"+":[57],"\u03f5),":[58],"for":[59],"any":[60],"\u03f5":[61],">":[62],"0,":[63],"but":[64],"at":[65],"same":[67],"time":[68],"it":[69,188],"not":[71],"how":[73],"efficiently":[75],"find":[76],"solution":[78],"with":[79,119],"comparable":[81],"performance":[82,122],"guarantee.":[83,123],"A":[84],"natural":[85],"question":[86],"arises":[88],"from":[89,103,152],"their":[90],"work":[91],"if":[93],"difference":[95],"between":[96],"these":[97],"guarantees":[98],"inherent":[100],"or":[101],"results":[102],"lack":[105],"suitable":[107],"techniques.":[108],"We":[109],"address":[110],"this":[111],"by":[113],"giving":[114],"quasi-polynomial":[116],"mentioned":[121],"More":[124],"specifically,":[125],"we":[126,174,184],"modify":[127],"local":[129],"search":[130],"and":[136,189],"provide":[137],"novel":[139],"analysis":[140],"lets":[142],"us":[143],"significantly":[144],"improve":[145],"bound":[147],"on":[148],"its":[149],"running":[150],"time:":[151],"2":[153],"O":[154,160],"(":[155],"n":[156,159,162],")":[157,163],"(log":[161],".":[164],"Our":[165],"techniques":[166],"also":[167],"have":[168],"interesting":[170],"property":[171],"although":[173],"use":[175],"rather":[177],"complex":[178],"in":[181],"analysis,":[183],"never":[185],"actually":[186],"solve":[187],"therefore":[190],"resulting":[192],"purely":[195],"combinatorial.":[196]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}