{"id":"https://openalex.org/W2964196438","doi":"https://doi.org/10.1137/17m1131027","title":"Efficient Approximations for the Online Dispersion Problem","display_name":"Efficient Approximations for the Online Dispersion Problem","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2964196438","doi":"https://doi.org/10.1137/17m1131027","mag":"2964196438"},"language":"en","primary_location":{"id":"doi:10.1137/17m1131027","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1131027","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5100394917","display_name":"Jing Chen","orcid":"https://orcid.org/0000-0002-7212-5297"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jing Chen","raw_affiliation_strings":["Stony Brook University"],"affiliations":[{"raw_affiliation_string":"Stony Brook University","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100374364","display_name":"Bo Li","orcid":"https://orcid.org/0000-0001-7500-8355"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bo Li","raw_affiliation_strings":["Stony Brook University"],"affiliations":[{"raw_affiliation_string":"Stony Brook University","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101448152","display_name":"Yingkai Li","orcid":"https://orcid.org/0000-0002-8607-1453"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yingkai Li","raw_affiliation_strings":["Stony Brook University"],"affiliations":[{"raw_affiliation_string":"Stony Brook University","institution_ids":["https://openalex.org/I59553526"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100394917"],"corresponding_institution_ids":["https://openalex.org/I59553526"],"apc_list":null,"apc_paid":null,"fwci":0.5306,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.68622266,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"48","issue":"2","first_page":"373","last_page":"416"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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":0.9997000098228455,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"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.9980000257492065,"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/polytope","display_name":"Polytope","score":0.7190941572189331},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6606495380401611},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5886277556419373},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.5853034853935242},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5703130960464478},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5454980134963989},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5429174900054932},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5304336547851562},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5034183859825134},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.4963999390602112},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.49503985047340393},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.461404025554657},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4334762394428253},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3793310225009918},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1598735749721527}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7190941572189331},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6606495380401611},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5886277556419373},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.5853034853935242},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5703130960464478},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5454980134963989},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5429174900054932},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5304336547851562},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5034183859825134},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.4963999390602112},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.49503985047340393},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.461404025554657},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4334762394428253},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3793310225009918},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1598735749721527},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/17m1131027","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1131027","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.4300000071525574}],"awards":[{"id":"https://openalex.org/G5482152551","display_name":null,"funder_award_id":"1553385","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1965734368","https://openalex.org/W1977429445","https://openalex.org/W1981973022","https://openalex.org/W1988013311","https://openalex.org/W2013451793","https://openalex.org/W2016199854","https://openalex.org/W2018449309","https://openalex.org/W2019137296","https://openalex.org/W2039757076","https://openalex.org/W2056078401","https://openalex.org/W2061779282","https://openalex.org/W2078659331","https://openalex.org/W2081797760","https://openalex.org/W2091041793","https://openalex.org/W2100961486","https://openalex.org/W2104589295","https://openalex.org/W2123894468","https://openalex.org/W2136442119","https://openalex.org/W2139919335","https://openalex.org/W2141627423","https://openalex.org/W2151888048","https://openalex.org/W2159130720","https://openalex.org/W2174353807","https://openalex.org/W2177686805","https://openalex.org/W2209399941","https://openalex.org/W2301261742","https://openalex.org/W2317162580","https://openalex.org/W2321068009","https://openalex.org/W2332852956","https://openalex.org/W2745300566","https://openalex.org/W3100495456","https://openalex.org/W4251533424"],"related_works":["https://openalex.org/W1973529814","https://openalex.org/W1509863433","https://openalex.org/W1991566967","https://openalex.org/W2173317315","https://openalex.org/W2810411596","https://openalex.org/W1854155592","https://openalex.org/W2499461890","https://openalex.org/W1984819898","https://openalex.org/W2246386411","https://openalex.org/W2171134634"],"abstract_inverted_index":{"The":[0,21],"dispersion":[1,86,311],"problem":[2,87,104,122,158,177,217,276],"has":[3],"been":[4],"widely":[5],"studied":[6],"in":[7,32,81,88,171,204,218,277],"computational":[8,265],"geometry":[9],"and":[10,13,45,60,65,117,167,197,226,244,261,292],"facility":[11],"location":[12],"is":[14,23,98,159,188,202,211,267],"closely":[15],"related":[16],"to":[17,24,106,124,287,309],"the":[18,47,50,57,78,82,84,100,108,118,126,129,133,138,153,157,165,174,198,215,255,258,273,288,293],"packing":[19],"problem.":[20],"goal":[22],"locate":[25],"$n$":[26],"points":[27,58],"(e.g.,":[28],"facilities":[29],"or":[30],"persons)":[31],"a":[33,146,179,183,219,223,227,241,245,269,283,299],"$k$-dimensional":[34,234,279],"polytope,":[35],"so":[36],"that":[37,111,208],"they":[38],"are":[39,92,141],"far":[40],"away":[41],"from":[42,46,254],"each":[43],"other":[44],"boundary":[48,315],"of":[49,128,257,301],"polytope.":[51],"In":[52],"many":[53],"real-world":[54],"scenarios,":[55],"however,":[56],"arrive":[59],"depart":[61],"at":[62,114,302],"different":[63,314],"times,":[64],"decisions":[66],"must":[67],"be":[68,194],"made":[69],"without":[70],"knowing":[71],"future":[72],"events.":[73],"Therefore,":[74],"we":[75,181,221,239,281],"study,":[76],"for":[77,232,272],"first":[79],"time":[80,97,135,201],"literature,":[83],"online":[85,139,175,259,289,310],"Euclidean":[89],"space.":[90],"There":[91],"two":[93],"natural":[94],"objectives":[95],"when":[96,156,264],"involved:":[99],"all-time":[101],"worst-case":[102],"(ATWC)":[103],"tries":[105,123],"maximize":[107,125],"minimum":[109,130],"distance":[110,120,131],"ever":[112],"appears":[113],"any":[115],"time;":[116],"cumulative":[119,149],"(CD)":[121],"integral":[127],"throughout":[132],"whole":[134],"interval.":[136],"Interestingly,":[137,271],"problems":[140,260,312],"highly":[142],"nontrivial":[143],"even":[144,155,263],"on":[145,178],"segment.":[147],"For":[148,173,214],"distance,":[150],"this":[151,209],"remains":[152],"case":[154],"time-dependent":[160],"but":[161],"offline,":[162],"with":[163,236,313],"all":[164],"arriving":[166],"departure":[168],"times":[169],"given":[170],"advance.":[172],"ATWC":[176,290],"segment,":[180],"construct":[182],"deterministic":[184],"polynomial-time":[185,284],"algorithm":[186,210,225,243],"which":[187],"$(2\\ln":[189],"2+\\epsilon)$-competitive,":[190],"where":[191],"$\\epsilon>0$":[192],"can":[193],"arbitrarily":[195],"small":[196],"algorithm's":[199],"running":[200],"polynomial":[203],"$\\frac{1}{\\epsilon}$.":[205],"We":[206],"show":[207],"actually":[212],"optimal.":[213],"same":[216],"square,":[220],"provide":[222,240,282],"$1.591$-competitive":[224],"$1.183$":[228],"lower":[229,247,251],"bound.":[230,248],"Furthermore,":[231],"arbitrary":[233,278],"polytopes":[235],"$k\\geq":[237],"2$,":[238],"$\\frac{2}{1-\\epsilon}$-competitive":[242],"$\\frac{7}{6}$":[246],"All":[249],"our":[250],"bounds":[252],"come":[253],"structure":[256],"hold":[262],"complexity":[266],"not":[268],"concern.":[270],"offline":[274],"CD":[275],"polytopes,":[280],"black-box":[285],"reduction":[286],"problem,":[291],"resulting":[294],"competitive":[295],"ratio":[296],"increases":[297],"by":[298],"factor":[300],"most":[303],"2.":[304],"Our":[305],"techniques":[306],"also":[307],"apply":[308],"conditions.":[316]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}