{"id":"https://openalex.org/W2121026385","doi":"https://doi.org/10.1109/ipdps.2010.5470349","title":"A local, distributed constant-factor approximation algorithm for the dynamic facility location problem","display_name":"A local, distributed constant-factor approximation algorithm for the dynamic facility location problem","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2121026385","doi":"https://doi.org/10.1109/ipdps.2010.5470349","mag":"2121026385"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2010.5470349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2010.5470349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5066191243","display_name":"Bastian Degener","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Bastian Degener","raw_affiliation_strings":["Heinz Nixdorf Institute, Computer Science Department, University of Paderborn, Paderborn, Germany","Heinz Nixdorf Institute, Computer Science Department, University of Paderborn 33095 Paderborn, Germany"],"affiliations":[{"raw_affiliation_string":"Heinz Nixdorf Institute, Computer Science Department, University of Paderborn, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"Heinz Nixdorf Institute, Computer Science Department, University of Paderborn 33095 Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057341664","display_name":"Barbara Kempkes","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Barbara Kempkes","raw_affiliation_strings":["Heinz Nixdorf Institute, Computer Science Department, University of Paderborn, Paderborn, Germany","Heinz Nixdorf Institute, Computer Science Department, University of Paderborn 33095 Paderborn, Germany"],"affiliations":[{"raw_affiliation_string":"Heinz Nixdorf Institute, Computer Science Department, University of Paderborn, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"Heinz Nixdorf Institute, Computer Science Department, University of Paderborn 33095 Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008580571","display_name":"Peter Pietrzyk","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter Pietrzyk","raw_affiliation_strings":["Heinz Nixdorf Institute, Computer Science Department, University of Paderborn, Paderborn, Germany","Heinz Nixdorf Institute, Computer Science Department, University of Paderborn 33095 Paderborn, Germany"],"affiliations":[{"raw_affiliation_string":"Heinz Nixdorf Institute, Computer Science Department, University of Paderborn, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"Heinz Nixdorf Institute, Computer Science Department, University of Paderborn 33095 Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066191243"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":null,"apc_paid":null,"fwci":0.6691,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72218781,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"5408","issue":null,"first_page":"1","last_page":"10"},"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.9991999864578247,"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.9991999864578247,"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.9991000294685364,"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/T10246","display_name":"Mobile Ad Hoc Networks","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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7158920764923096},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6914686560630798},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6591037511825562},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.652334451675415},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6306420564651489},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5899768471717834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5883907675743103},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5678315162658691},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4829675257205963},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.43820640444755554},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.42597365379333496},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37034326791763306},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35951632261276245},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.30946779251098633},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30709943175315857},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08509775996208191},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07437801361083984},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06645265221595764}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7158920764923096},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6914686560630798},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6591037511825562},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.652334451675415},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6306420564651489},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5899768471717834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5883907675743103},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5678315162658691},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4829675257205963},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.43820640444755554},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.42597365379333496},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37034326791763306},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35951632261276245},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.30946779251098633},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30709943175315857},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08509775996208191},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07437801361083984},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06645265221595764},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2010.5470349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2010.5470349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W83629654","https://openalex.org/W1526676851","https://openalex.org/W1585296592","https://openalex.org/W1972925608","https://openalex.org/W1977541023","https://openalex.org/W2035506862","https://openalex.org/W2035994564","https://openalex.org/W2066745247","https://openalex.org/W2090964330","https://openalex.org/W2101622070","https://openalex.org/W2102570161","https://openalex.org/W2107390991","https://openalex.org/W2122381782","https://openalex.org/W2129751925","https://openalex.org/W2136442119","https://openalex.org/W2148938772","https://openalex.org/W2165142526","https://openalex.org/W2166590374","https://openalex.org/W2911597709","https://openalex.org/W4235017573","https://openalex.org/W6643375451","https://openalex.org/W6675473623"],"related_works":["https://openalex.org/W1973529814","https://openalex.org/W1509863433","https://openalex.org/W2810411596","https://openalex.org/W2499461890","https://openalex.org/W1854155592","https://openalex.org/W1991566967","https://openalex.org/W2476148062","https://openalex.org/W276709744","https://openalex.org/W4385597667","https://openalex.org/W2173317315"],"abstract_inverted_index":{"We":[0,73],"present":[1],"a":[2,23,26,40,49,82],"distributed,":[3],"local":[4,45],"solution":[5],"to":[6,20,63,81],"the":[7,55,64,77,88],"dynamic":[8],"facility":[9,24],"location":[10],"problem":[11],"in":[12,43],"general":[13],"metrics,":[14],"where":[15],"each":[16,36,96],"node":[17,37,97],"is":[18,57,79],"able":[19],"act":[21],"as":[22],"or":[25],"client.":[27],"To":[28],"decide":[29],"which":[30],"r":[31],"ole":[32],"it":[33],"should":[34],"take,":[35],"keeps":[38],"up":[39],"simple":[41],"invariant":[42,56],"its":[44],"neighborhood.":[46],"This":[47],"guarantees":[48],"global":[50],"constant":[51,83],"factor":[52],"approximation":[53],"when":[54],"satisfied":[58],"at":[59,98],"all":[60],"nodes.":[61],"Due":[62],"changing":[65],"distances":[66],"between":[67],"nodes,":[68],"invariants":[69,78],"can":[70],"be":[71],"violated.":[72],"show":[74],"that":[75],"restoring":[76],"bounded":[80],"neighborhood,":[84],"takes":[85],"logarithmic":[86],"(in":[87],"number":[89],"of":[90],"nodes)":[91],"asynchronous":[92],"rounds":[93],"and":[94],"affects":[95],"most":[99],"twice":[100],"per":[101],"violation.":[102]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}