{"id":"https://openalex.org/W6911227498","doi":"https://doi.org/10.5075/epfl-thesis-9946","title":"Approximation Algorithms for Allocation and Network Design","display_name":"Approximation Algorithms for Allocation and Network Design","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W6911227498","doi":"https://doi.org/10.5075/epfl-thesis-9946"},"language":"en","primary_location":{"id":"pmh:oai:infoscience.epfl.ch:302965","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/302965","pdf_url":"https://infoscience.epfl.ch/bitstreams/13a1a930-58d9-44e7-94aa-3f17ba58060c/download","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":"http://infoscience.epfl.ch/record/302965","raw_type":"Text"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/bitstreams/13a1a930-58d9-44e7-94aa-3f17ba58060c/download","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Bamas, Etienne Michel Fran\u00e7ois","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bamas, Etienne Michel Fran\u00e7ois","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.590399980545044,"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.590399980545044,"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.12139999866485596,"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.10339999943971634,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7325000166893005},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.637499988079071},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5827000141143799},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5486000180244446},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5429999828338623},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.5353999733924866},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.46230000257492065},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4090000092983246},{"id":"https://openalex.org/keywords/linear-approximation","display_name":"Linear approximation","score":0.3970000147819519},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3961000144481659}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7325000166893005},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.637499988079071},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5827000141143799},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5486000180244446},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5429999828338623},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.5353999733924866},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48989999294281006},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.46230000257492065},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43059998750686646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42179998755455017},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4090000092983246},{"id":"https://openalex.org/C160824197","wikidata":"https://www.wikidata.org/wiki/Q2071054","display_name":"Linear approximation","level":3,"score":0.3970000147819519},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3961000144481659},{"id":"https://openalex.org/C91873725","wikidata":"https://www.wikidata.org/wiki/Q3445816","display_name":"Function approximation","level":3,"score":0.3853999972343445},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.3837999999523163},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.376800000667572},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.3479999899864197},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.30480000376701355},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.2906999886035919},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2806999981403351},{"id":"https://openalex.org/C2778999518","wikidata":"https://www.wikidata.org/wiki/Q8","display_name":"Happiness","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.27489998936653137},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.265500009059906},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2540999948978424},{"id":"https://openalex.org/C153658351","wikidata":"https://www.wikidata.org/wiki/Q746264","display_name":"Constant function","level":3,"score":0.24130000174045563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23970000445842743},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.23360000550746918},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.22100000083446503},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.21709999442100525},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.21400000154972076},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.21320000290870667},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19990000128746033},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.19259999692440033},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.1875},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.18539999425411224},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.18369999527931213},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.18289999663829803},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.17720000445842743},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.17669999599456787}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:infoscience.epfl.ch:302965","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/302965","pdf_url":"https://infoscience.epfl.ch/bitstreams/13a1a930-58d9-44e7-94aa-3f17ba58060c/download","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":"http://infoscience.epfl.ch/record/302965","raw_type":"Text"},{"id":"doi:10.5075/epfl-thesis-9946","is_oa":true,"landing_page_url":"https://doi.org/10.5075/epfl-thesis-9946","pdf_url":null,"source":{"id":"https://openalex.org/S4306400488","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"thesis"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:302965","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/302965","pdf_url":"https://infoscience.epfl.ch/bitstreams/13a1a930-58d9-44e7-94aa-3f17ba58060c/download","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":"http://infoscience.epfl.ch/record/302965","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6911227498.pdf","grobid_xml":"https://content.openalex.org/works/W6911227498.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,84,146,294,340,461],"this":[1,89,219,280,299,475],"thesis,":[2,90,300],"we":[3,24,40,49,70,91,105,261,264,301],"give":[4,92,197,436],"new":[5],"approximation":[6,131,144,179,192,446],"algorithms":[7],"for":[8,95,210,285],"some":[9],"NP-hard":[10],"problems":[11],"arising":[12],"in":[13,38,54,100,111,132,140,172,193,207,218,226,247,271,279,363,379,397,404,413],"resource":[14,21],"allocation":[15,22],"and":[16,48,79,183,317,344,470],"network":[17,67],"design.":[18],"As":[19],"a":[20,128,136,155,176,190,248,257,291,314,332,382,426,437,444],"problem,":[23,403,425],"study":[25,71],"the":[26,33,58,61,66,75,80,85,96,107,112,115,141,148,165,168,184,211,222,227,232,235,252,286,295,304,327,338,365,398,402,406,422,450,454,458],"Santa":[27,97,108,223],"Claus":[28,98,109,224],"problem":[29,78,99,110,139,151,225,307,428,455],"(also":[30],"known":[31,284,383,456],"as":[32,154,311,457],"MaxMin":[34,149,212],"Fair":[35],"Allocation":[36],"problem)":[37],"which":[39,308,375,405],"are":[41,408],"given":[42],"$m$":[43],"agents,":[44],"$n$":[45],"indivisible":[46],"resources,":[47],"have":[50,234],"to":[51,56,161,201,330,360,429,449,474],"allocate":[52],"resources":[53],"order":[55,387],"maximize":[57],"happiness":[59,116,237],"of":[60,88,117,143,164,167,251,298,321,381,386,401,453],"least":[62],"happy":[63],"agent.":[64],"For":[65],"design":[68],"part,":[69],"two":[72,101],"key":[73,156,427],"problems:":[74],"Steiner":[76,305],"Forest":[77,306],"Matching":[81,423],"Augmentation":[82,424],"problem.":[83,170,214],"first":[86,357],"part":[87,220,297],"improved":[93],"guarantees":[94,189,352,368,443],"prominent":[102],"settings.":[103],"First,":[104],"consider":[106],"setting":[113,134,281,400],"where":[114,288],"each":[118,241],"agent":[119,242],"$i$":[120,243],"is":[121,135,244,256,290,309,329,359,376,420],"an":[122,198,203,267,318,348,353,369,414],"arbitrary":[123,319],"linear":[124,292],"function":[125,238],"$f_i$.":[126],"Obtaining":[127],"constant":[129,177],"factor":[130,178],"that":[133,159,173,263,335,347,442],"major":[137],"open":[138],"area":[142],"algorithms.":[145],"2009,":[147],"Arborescences":[150,213],"was":[152],"identified":[153],"special":[157,174],"case":[158,287],"appears":[160],"capture":[162],"most":[163],"difficulty":[166],"general":[169],"Even":[171],"case,":[175],"has":[180],"remained":[181],"elusive,":[182],"current":[185],"best":[186],"algorithm":[187,351,367,441],"only":[188,245,283],"polylogarithmic":[191],"quasi-polynomial":[194,208],"time.":[195,273],"We":[196,435],"exponential":[199],"improvement":[200],"this,":[202],"$O(\\textrm{poly}(\\log":[204],"\\log":[205,269,372,373],"(n)))$-approximation":[206],"time":[209,440],"Our":[215,356,417],"second":[216,296],"result":[217,358,419],"considers":[221],"restricted":[228],"assignment":[229],"case:":[230],"all":[231,337],"agents":[233],"same":[236],"$f$,":[239],"but":[240],"interested":[246],"subset":[249],"$\\Gamma_i$":[250],"resources.":[253],"When":[254],"$f$":[255,289],"monotone":[258],"submodular":[259],"function,":[260],"show":[262,361],"can":[265],"obtain":[266],"$O(\\log":[268,370],"n)$-approximation":[270],"polynomial":[272,439],"Before":[274],"our":[275,391],"work,":[276],"comparable":[277],"results":[278],"were":[282,466],"function.":[293],"start":[302],"with":[303],"defined":[310],"follows.":[312],"Given":[313],"graph":[315],"$G$":[316],"set":[320],"$k$":[322],"terminal":[323],"pairs":[324,407],"$\\{\\{s_1,t_1\\},\\ldots":[325],",\\{s_k,t_k\\}\\}$,":[326],"goal":[328],"return":[331],"minimum-weight":[333],"subgraph":[334],"connects":[336],"pairs.":[339],"1996,":[341],"Awerbuch,":[342],"Azar,":[343],"Bartal":[345],"showed":[346],"intuitive":[349],"greedy":[350,366],"$O(\\log^2":[354],"k)$-approximation.":[355],"that,":[362],"fact,":[364],"(k)\\cdot":[371],"(k))$-approximation,":[374],"nearly":[377],"tight":[378],"light":[380],"lower":[384],"bound":[385],"$\\Omega(\\log":[388],"k)$.":[389],"Interestingly,":[390],"analysis":[392],"also":[393],"gives":[394],"important":[395],"insights":[396],"online":[399],"revealed":[409],"one":[410,412],"by":[411],"adversarial":[415],"order.":[416],"last":[418],"on":[421],"compute":[430],"cheap":[431],"$2$-edge":[432],"connected":[433],"subgraphs.":[434],"simple":[438,476],"better-than-$2$":[445,464],"when":[447],"compared":[448],"standard":[451],"relaxation":[452],"cut":[459],"LP.":[460],"contrast,":[462],"previous":[463],"approximations":[465],"much":[467],"more":[468],"complicated":[469],"did":[471],"not":[472],"compare":[473],"relaxation.":[477]},"counts_by_year":[],"updated_date":"2026-03-09T08:58:05.943551","created_date":"2025-10-10T00:00:00"}