{"id":"https://openalex.org/W2168581227","doi":"https://doi.org/10.1145/3070694","title":"Combinatorial Algorithm for Restricted Max-Min Fair Allocation","display_name":"Combinatorial Algorithm for Restricted Max-Min Fair Allocation","publication_year":2017,"publication_date":"2017-05-26","ids":{"openalex":"https://openalex.org/W2168581227","doi":"https://doi.org/10.1145/3070694","mag":"2168581227"},"language":"en","primary_location":{"id":"doi:10.1145/3070694","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3070694","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/231685","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025454930","display_name":"Chidambaram Annamalai","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Chidambaram Annamalai","raw_affiliation_strings":["Department of Computer Science, ETH Zurich, Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021996741","display_name":"Christos Kalaitzis","orcid":null},"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"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Christos Kalaitzis","raw_affiliation_strings":["School of Computer and Communication Sciences, EPFL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer and Communication Sciences, EPFL","institution_ids":["https://openalex.org/I174424907"]}]},{"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":["School of Computer and Communication Sciences, EPFL, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer and Communication Sciences, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1247,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.94658704,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"13","issue":"3","first_page":"1","last_page":"28"},"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.9998000264167786,"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.9998000264167786,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.7730081081390381},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6454986333847046},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.5507930517196655},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5228822231292725},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4973595440387726},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.480949342250824},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48076722025871277},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4739784598350525},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4577348232269287},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4413675367832184},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4278927445411682},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4263206720352173},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4225141704082489},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.41185083985328674},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2809998691082001}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7730081081390381},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6454986333847046},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.5507930517196655},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5228822231292725},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4973595440387726},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.480949342250824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48076722025871277},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4739784598350525},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4577348232269287},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4413675367832184},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4278927445411682},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4263206720352173},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4225141704082489},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.41185083985328674},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2809998691082001},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3070694","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3070694","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:231685","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/231685","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:231685","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/231685","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":19,"referenced_works":["https://openalex.org/W1488906711","https://openalex.org/W1507039213","https://openalex.org/W1897132454","https://openalex.org/W1978593916","https://openalex.org/W1992678640","https://openalex.org/W2001927417","https://openalex.org/W2044380699","https://openalex.org/W2063302961","https://openalex.org/W2068859584","https://openalex.org/W2072870176","https://openalex.org/W2093066443","https://openalex.org/W2102201348","https://openalex.org/W2123976299","https://openalex.org/W2135932424","https://openalex.org/W2154014787","https://openalex.org/W2569791907","https://openalex.org/W2949308130","https://openalex.org/W2952993429","https://openalex.org/W2988480584"],"related_works":["https://openalex.org/W2962917430","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W1496354680","https://openalex.org/W2952847377","https://openalex.org/W2058038705","https://openalex.org/W2129303870","https://openalex.org/W3214829809","https://openalex.org/W2156087782","https://openalex.org/W2033501672"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,18,24,45,48,61,66,88,140,144,157,161],"basic":[3],"allocation":[4,50],"problem":[5,67],"of":[6,17,27,47,55,146],"assigning":[7],"resources":[8],"to":[9,11,43,51,121],"players":[10,137],"maximize":[12],"fairness.":[13],"This":[14],"is":[15,149,152],"one":[16],"few":[19],"natural":[20],"problems":[21],"that":[22,150],"enjoys":[23],"intriguing":[25],"status":[26],"having":[28],"a":[29,37,53,84,93],"better":[30],"estimation":[31],"algorithm":[32,64,86],"than":[33],"approximation":[34,63,142],"algorithm.":[35],"Indeed,":[36],"certain":[38],"Configuration-LP":[39,158],"can":[40],"be":[41],"used":[42,106],"estimate":[44],"value":[46],"optimal":[49],"within":[52],"factor":[54],"4+":[56],"\u03b5.":[57],"In":[58,74],"contrast,":[59],"however,":[60],"best-known":[62],"for":[65,87,101],"has":[68],"an":[69],"unspecified":[70],"large":[71],"constant":[72],"guarantee.":[73],"this":[75,80,108],"article,":[76],"we":[77,126],"significantly":[78],"narrow":[79],"gap":[81],"by":[82,98,110],"giving":[83],"13-approximation":[85],"problem.":[89],"Our":[90],"approach":[91,148],"develops":[92],"local":[94,118],"search":[95,119],"technique":[96],"introduced":[97],"Haxell":[99],"[13]":[100],"hypergraph":[102],"matchings":[103],"and":[104,113,135,155],"later":[105],"in":[107,123,160],"context":[109],"Asadpour,":[111],"Feige,":[112],"Saberi":[114],"[2].":[115],"For":[116],"our":[117,147],"procedure":[120],"terminate":[122],"polynomial":[124],"time,":[125],"introduce":[127],"several":[128],"new":[129],"ideas,":[130],"such":[131],"as":[132],"lazy":[133],"updates":[134],"greedy":[136],".":[138],"Besides":[139],"improved":[141],"guarantee,":[143],"highlight":[145],"it":[151],"purely":[153],"combinatorial":[154],"uses":[156],"only":[159],"analysis.":[162]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}