{"id":"https://openalex.org/W2809211406","doi":null,"title":"Approximation algorithms for facility location problems","display_name":"Approximation algorithms for facility location problems","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2809211406","mag":"2809211406"},"language":"en","primary_location":{"id":"mag:2809211406","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=1048406","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"book","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041526408","display_name":"Yinyu Ye","orcid":"https://orcid.org/0009-0001-3239-2622","observed_orcids":["https://orcid.org/0009-0001-3239-2622"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yinyu Ye","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0009-0001-3239-2622","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100462859","display_name":"Jiawei Zhang","orcid":"https://orcid.org/0000-0003-4988-6028","observed_orcids":["https://orcid.org/0000-0003-4988-6028"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiawei Zhang","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-4988-6028","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6146,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.93357934,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.8726000189781189,"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.8726000189781189,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.09000000357627869,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.00860000029206276,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/facility-location","display_name":"facility location","score":0.7369999885559082},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8679999709129333},{"id":"https://openalex.org/keywords/uncapacitated-facility-location-problem","display_name":"uncapacitated facility location","score":0.9760000109672546},{"id":"https://openalex.org/keywords/capacitated-facility-location","display_name":"capacitated facility location","score":0.9940000176429749},{"id":"https://openalex.org/keywords/dynamic-facility-location","display_name":"dynamic facility location","score":0.9940000176429749},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"triangle inequality","score":0.796999990940094},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7379999756813049},{"id":"https://openalex.org/keywords/distribution-system-design","display_name":"distribution system design","score":0.5170000195503235},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.531000018119812}],"concepts":[{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.9359009861946106},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7002644538879395},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5702366828918457},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5577799081802368},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5082692503929138},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.4750918447971344},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.4356311559677124},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.42619168758392334},{"id":"https://openalex.org/C50524431","wikidata":"https://www.wikidata.org/wiki/Q4545814","display_name":"1-center problem","level":3,"score":0.4133959710597992},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35933494567871094},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11388501524925232},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2809211406","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=1048406","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7095435379","https://openalex.org/W1998735557","https://openalex.org/W7099662078","https://openalex.org/W7096886583","https://openalex.org/W7098934029","https://openalex.org/W2208218418","https://openalex.org/W7098807186","https://openalex.org/W7096271524","https://openalex.org/W2076746184","https://openalex.org/W2054475294"],"abstract_inverted_index":{"One":[0],"of":[1,6,41,55,99,103,110,120,139,154,193,211,227,298,323,334],"the":[2,53,56,81,91,108,118,152,166,177,202,212,273,281,289,308,321,332,341],"most":[3],"important":[4,29,209],"aspects":[5],"logistics":[7],"is":[8,61,132,170,244,306],"to":[9,12,65,124,133,146,150,320,325,336],"decide":[10],"where":[11,324],"locate":[13,326,337],"new":[14],"facilities":[15,135,274],"such":[16],"as":[17],"plants,":[18],"distribution":[19,33],"centers,":[20],"and":[21,52,87,117,142,157,196,251],"retailers.":[22],"Facility":[23],"location":[24,48,85],"models":[25],"not":[26],"only":[27,223,295],"have":[28],"applications":[30],"in":[31,59,275],"designing":[32],"systems,":[34],"but":[35],"also":[36,206,330],"often":[37,62],"form":[38],"identifiable":[39],"parts":[40],"other":[42],"practical":[43],"problems.":[44],"However,":[45],"many":[46],"discrete":[47],"problems":[49],"are":[50,95,294],"NP-hard":[51],"scale":[54],"instances":[57],"arising":[58],"practice":[60],"too":[63],"large":[64],"be":[66,270],"solved":[67],"optimally.":[68],"In":[69,185,318],"this":[70,186,237,286,328,346],"thesis,":[71,187],"we":[72,94,188,300],"focus":[73],"on":[74],"polynomial":[75],"time":[76],"approximation":[77,242,343],"algorithms":[78],"for":[79,106,176,201,236,257,285,345],"solving":[80],"well-known":[82],"uncapacitated":[83,92,178,203,213],"facility":[84,113,126,149,155,217,220,265,311],"problem":[86,179,329],"its":[88,241],"generalizations.":[89],"\r\nIn":[90],"problem,":[93,214],"given":[96,259],"a":[97,101,112,125,137,173,190,198,224,231,276,302],"set":[98,102],"clients;":[100],"possible":[104],"locations":[105],"facilities,":[107,299,327],"cost":[109,119],"opening":[111,156],"at":[114,127,136],"each":[115,122,128,144],"location,":[116],"connecting":[121],"client":[123,145],"location.":[129],"The":[130,267,313],"objective":[131],"open":[134,148],"subset":[138],"these":[140],"locations,":[141],"connect":[143],"an":[147],"minimize":[151],"sum":[153],"connection":[158,163],"costs.":[159],"We":[160,229,239,279,339],"assume":[161],"that":[162,172],"costs":[164],"obey":[165],"triangle":[167],"inequality.":[168],"It":[169],"known":[171],"1.46-approximation":[174],"algorithm":[175,200,235,284,344],"would":[180],"imply":[181],"P":[182],"=":[183],"NP.":[184],"improve":[189],"long":[191],"line":[192],"previous":[194],"results":[195],"give":[197,280,301],"1.52-approximation":[199],"problem.":[204,238,287,347],"\r\nWe":[205],"consider":[207],"several":[208],"generalizations":[210],"including:":[215],"(1)\u00a0Capacitated":[216],"location:":[218,266,312],"Each":[219],"can":[221],"serve":[222],"certain":[225],"amount":[226],"clients.":[228],"present":[230],"multi-exchange":[232],"local":[233],"search":[234],"show":[240],"ratio":[243],"between":[245,316],"3":[246,252],"+":[247,253,255],"22":[248,254],"\u2212":[249],"e":[250,256,261],"any":[258],"constant":[260],">":[262],"0.":[263],"(2)\u00a0Multi-level":[264],"demands":[268],"must":[269],"routed":[271],"among":[272],"hierarchical":[277],"order.":[278],"best":[282],"combinatorial":[283],"For":[288],"special":[290],"case":[291],"when":[292,335],"there":[293],"two":[296],"levels":[297],"1.77-approximation":[303],"algorithm,":[304],"which":[305],"currently":[307],"best.":[309],"(3)\u00a0Dynamic":[310],"demand":[314],"varies":[315],"time-periods.":[317],"addition":[319],"question":[322,333],"addresses":[331],"them.":[338],"develop":[340],"first":[342]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2018-06-29T00:00:00"}