{"id":"https://openalex.org/W2808857600","doi":"https://doi.org/10.1145/3210377.3210389","title":"Online Facility Location with Mobile Facilities","display_name":"Online Facility Location with Mobile Facilities","publication_year":2018,"publication_date":"2018-07-11","ids":{"openalex":"https://openalex.org/W2808857600","doi":"https://doi.org/10.1145/3210377.3210389","mag":"2808857600"},"language":"en","primary_location":{"id":"doi:10.1145/3210377.3210389","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210389","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","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/A5036811323","display_name":"Bj\u00f6rn Feldkord","orcid":"https://orcid.org/0000-0001-6591-2420"},"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":"Bj\u00f6rn Feldkord","raw_affiliation_strings":["Paderborn University, Paderborn, Germany"],"affiliations":[{"raw_affiliation_string":"Paderborn University, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109961260","display_name":"Friedhelm Meyer auf der Heide","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":"Friedhelm Meyer auf der Heide","raw_affiliation_strings":["Paderborn University, Paderborn, Germany"],"affiliations":[{"raw_affiliation_string":"Paderborn University, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036811323"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":null,"apc_paid":null,"fwci":0.9227,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.77447654,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"373","last_page":"381"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9950000047683716,"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/T11182","display_name":"Auction Theory and Applications","score":0.9948999881744385,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.845393180847168},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.7301878929138184},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7148146629333496},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6520774364471436},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6481262445449829},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6257315874099731},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.5983809232711792},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5481340289115906},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.5325635671615601},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5321710705757141},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5077829957008362},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.506773054599762},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.5035316348075867},{"id":"https://openalex.org/keywords/real-line","display_name":"Real line","score":0.490686297416687},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.48947060108184814},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4544634222984314},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.441449373960495},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4253352880477905},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4183483123779297},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3947226107120514},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2728844881057739},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26771169900894165},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12831827998161316},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10095590353012085},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09885618090629578},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08440765738487244}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.845393180847168},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.7301878929138184},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7148146629333496},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6520774364471436},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6481262445449829},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6257315874099731},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.5983809232711792},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5481340289115906},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.5325635671615601},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5321710705757141},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5077829957008362},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.506773054599762},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.5035316348075867},{"id":"https://openalex.org/C75432250","wikidata":"https://www.wikidata.org/wiki/Q29654355","display_name":"Real line","level":2,"score":0.490686297416687},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.48947060108184814},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4544634222984314},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.441449373960495},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4253352880477905},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4183483123779297},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3947226107120514},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2728844881057739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26771169900894165},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12831827998161316},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10095590353012085},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09885618090629578},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08440765738487244},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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":1,"locations":[{"id":"doi:10.1145/3210377.3210389","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210389","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1486124781","https://openalex.org/W1522297331","https://openalex.org/W1977429445","https://openalex.org/W2004466770","https://openalex.org/W2006805721","https://openalex.org/W2014297625","https://openalex.org/W2023146810","https://openalex.org/W2028294891","https://openalex.org/W2049943172","https://openalex.org/W2066745247","https://openalex.org/W2125938788","https://openalex.org/W2295789962","https://openalex.org/W2739391015"],"related_works":["https://openalex.org/W2087343661","https://openalex.org/W2208110155","https://openalex.org/W1996806106","https://openalex.org/W2781235162","https://openalex.org/W2058681277","https://openalex.org/W2090027528","https://openalex.org/W2047204419","https://openalex.org/W2951573806","https://openalex.org/W2088826026","https://openalex.org/W96431103"],"abstract_inverted_index":{"We":[0,115,123,234],"examine":[1],"the":[2,12,19,22,28,32,49,73,82,90,125,133,193,198,207,211,219,225,243,247,253,275],"Online":[3,54,75],"Facility":[4,55,76],"Location":[5,56,77],"Problem":[6],"in":[7,112,120,148,188],"an":[8],"augmented":[9],"version,":[10],"where":[11,79,165],"online":[13,44,118],"algorithm":[14],"is":[15,34,40,162,168,259,271],"allowed":[16],"to":[17,27,42,105,135,140,160,183,213,263],"adapt":[18],"position":[20,33],"of":[21,53,65,110,195,209,229,250,256,277],"facilities":[23,134,230],"for":[24,72,94,154],"costs":[25,153],"proportional":[26],"distance":[29,146,216],"by":[30,274],"which":[31,46],"changed.":[35],"In":[36,100,192,206],"this":[37],"setting,":[38],"it":[39],"possible":[41],"construct":[43],"algorithms":[45,96,119,172,258],"deal":[47],"with":[48,261],"lower":[50,63],"bound":[51,64],"instances":[52],"much":[57],"more":[58],"effectively.":[59],"Fotakis":[60],"showed":[61],"a":[62,144,156,159,169,214],"$\u00d8mega(\\frac\u0142og":[66],"n":[67,70,80,111],"\u0142og":[68,69],")$":[71],"original":[74],"Problem,":[78],"denotes":[81],"number":[83,276],"clients.":[84],"This":[85],"bounds":[86],"holds":[87],"even":[88],"on":[89,203,224,242],"real":[91,244],"line":[92],"and":[93,131,178,231,267],"randomized":[95,117],"against":[97],"oblivious":[98],"adversaries.":[99],"contrast,":[101],"we":[102],"are":[103,173,239],"able":[104],"achieve":[106],"competitive":[107,199,220,254],"ratios":[108],"independent":[109],"our":[113,237,257],"model.":[114],"propose":[116],"two":[121],"settings:":[122],"consider":[124],"Euclidean":[126,248],"space":[127,249],"(of":[128],"arbitrary":[129,196],"dimension)":[130],"allow":[132],"either":[136],"move":[137,141],"arbitrarily":[138],"or":[139],"at":[142,184],"most":[143,185],"constant":[145,215],"m":[147,217,232,268],"each":[149,189],"time":[150,190],"step.":[151,191],"The":[152],"moving":[155],"facility":[157,187],"from":[158],"b":[161],"$D\\cdot":[163],"d(a,b)$":[164],"$D\\geq":[166],"1$":[167],"constant.":[170],"Our":[171],"memoryless":[174],"w.r.t.":[175],"past":[176],"requests":[177],"only":[179,201],"make":[180],"local":[181],"modifications":[182],"one":[186],"case":[194,208],"movement,":[197],"ratio":[200,221,255],"depends":[202,223],"D":[204,264],".":[205,233],"limiting":[210],"movement":[212],",":[218,265,269],"additionally":[222,272],"opening":[226],"cost":[227],"$c_f$":[228,266],"show":[235],"that":[236],"results":[238],"asymptotically":[240],"tight":[241,260],"line.":[245],"For":[246],"higher":[251],"dimensions,":[252],"respect":[262],"but":[270],"impacted":[273],"optimal":[278],"facilities.":[279]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"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}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}