{"id":"https://openalex.org/W2533806635","doi":"https://doi.org/10.1137/15m1031217","title":"Minimizing Co-location Potential of Moving Entities","display_name":"Minimizing Co-location Potential of Moving Entities","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2533806635","doi":"https://doi.org/10.1137/15m1031217","mag":"2533806635"},"language":"en","primary_location":{"id":"doi:10.1137/15m1031217","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1031217","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":true,"oa_status":"green","oa_url":"https://dspace.library.uu.nl/handle/1874/350854","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089479056","display_name":"William J. Evans","orcid":"https://orcid.org/0000-0002-0651-418X"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"William Evans","raw_affiliation_strings":["University of British Columbia, Vancouver, BC, Canada"],"affiliations":[{"raw_affiliation_string":"University of British Columbia, Vancouver, BC, Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069172477","display_name":"David Kirkpatrick","orcid":"https://orcid.org/0000-0002-3276-2734"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]},{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["CA","NL"],"is_corresponding":false,"raw_author_name":"David Kirkpatrick","raw_affiliation_strings":["Utrecht University, Utrecht, The Netherlands","University of British Columbia, Vancouver, BC, Canada"],"affiliations":[{"raw_affiliation_string":"Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"University of British Columbia, Vancouver, BC, Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035284028","display_name":"Maarten L\u00f6ffler","orcid":"https://orcid.org/0009-0001-9403-8856"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maarten L\u00f6ffler","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5032979919","display_name":"Frank Staals","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Frank Staals","raw_affiliation_strings":["Utrecht University, Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5032979919"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":null,"apc_paid":null,"fwci":0.9108,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.79079878,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"45","issue":"5","first_page":"1870","last_page":"1893"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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.9998000264167786,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9936000108718872,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.653589129447937},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6327672004699707},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5016822814941406},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4723067283630371},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.4190472364425659},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32224327325820923},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3058096766471863},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.208921879529953}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.653589129447937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6327672004699707},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5016822814941406},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4723067283630371},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4190472364425659},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32224327325820923},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3058096766471863},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.208921879529953},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/15m1031217","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1031217","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"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/350854","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/350854","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 45(5), 1870. Society for Industrial and Applied Mathematics Publications","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/350854","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/350854","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 45(5), 1870. Society for Industrial and Applied Mathematics Publications","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W114064698","https://openalex.org/W1481347950","https://openalex.org/W1535323908","https://openalex.org/W1816717522","https://openalex.org/W1861497326","https://openalex.org/W1975512711","https://openalex.org/W1996390648","https://openalex.org/W2006078669","https://openalex.org/W2043675696","https://openalex.org/W2048774463","https://openalex.org/W2068019092","https://openalex.org/W2080570254","https://openalex.org/W2105946172","https://openalex.org/W2119339514","https://openalex.org/W2130509928","https://openalex.org/W2140338233","https://openalex.org/W2147026670","https://openalex.org/W2155974215","https://openalex.org/W2157158868","https://openalex.org/W2165543827","https://openalex.org/W2208163925","https://openalex.org/W2235217783","https://openalex.org/W2303362612","https://openalex.org/W2309712606","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2027972911","https://openalex.org/W2146343568","https://openalex.org/W2013643406","https://openalex.org/W4390751688","https://openalex.org/W1967209836","https://openalex.org/W2165839536"],"abstract_inverted_index":{"We":[0,26,97,181],"study":[1],"the":[2,8,34,64,81,95,101,104,107,114,125,136,148,152,159,175,193,201,210,238,243,246,250,264,279,282,287],"problem":[3,247],"of":[4,7,10,37,47,67,83,103,113,116,138,151,178,195,212,218,229,248,281,284],"maintaining":[5],"knowledge":[6],"locations":[9,66,82,290],"$n$":[11,288],"entities":[12,69,85,117,219,265],"that":[13,90,118,171,299],"are":[14],"moving,":[15],"each":[16],"with":[17,237],"some,":[18],"possibly":[19],"different,":[20],"upper":[21,190],"bound":[22,191],"on":[23,192],"their":[24],"speed.":[25],"assume":[27],"a":[28,45,143,227],"setting":[29],"where":[30,276],"we":[31,51,60,75,134,146],"can":[32,61],"query":[33,43,53,132,140],"current":[35],"location":[36],"any":[38,54,71,167,268],"one":[39,72,170],"entity,":[40],"but":[41],"this":[42,58],"takes":[44],"unit":[46],"time,":[48],"during":[49],"which":[50],"cannot":[52],"other":[55],"entities.":[56],"In":[57],"model,":[59],"never":[62],"know":[63],"exact":[65],"all":[68,84,110,179,303],"at":[70,86,122,206,225,232,260],"time.":[73],"Instead,":[74],"wish":[76],"to":[77,158,309],"minimize":[78],"uncertainty":[79,99],"concerning":[80],"some":[87],"target":[88],"time":[89,203,285],"is":[91,198,205,231,253,257,274,278,305],"t":[92,204,256],"units":[93],"in":[94,142,173,267,302],"future.":[96],"measure":[98],"by":[100,155,166,224],"ply":[102,126,153,161,164,252],"potential":[105],"locations:":[106],"maximum":[108],"over":[109],"points":[111],"$x$":[112],"number":[115,211],"could":[119,127],"potentially":[120],"be":[121,128],"$x$.":[123],"Since":[124],"large":[129],"for":[130],"every":[131],"strategy,":[133,168,301],"analyze":[135],"performance":[137],"our":[139,156,272,300],"strategy":[141,157,185,273],"competitive":[144],"framework:":[145],"consider":[147],"worst-case":[149],"ratio":[150],"achieved":[154],"intrinsic":[160,251],"(the":[162],"smallest":[163],"achievable":[165],"even":[169,241],"knows":[172],"advance":[174],"full":[176,244],"trajectories":[177],"entities).":[180],"describe":[182],"an":[183,189],"efficient":[184],"that,":[186,240],"knowing":[187],"only":[188],"speed":[194,215,221],"individual":[196],"entities,":[197],"$O(k)$-competitive,":[199],"provided":[200],"lead":[202],"least":[207,261],"2n":[208],"and":[209,263],"different":[213],"entity":[214,289],"classes":[216],"(groups":[217],"whose":[220],"bounds":[222,297],"differ":[223],"most":[226,233],"factor":[228],"two)":[230],"$k$.":[234],"(This":[235],"contrasts":[236],"fact":[239],"given":[242],"trajectories,":[245],"computing":[249],"NP-hard.)":[254],"If":[255],"small,":[258],"though":[259],"$n$,":[262],"move":[266],"constant":[269,310],"dimension":[270],"$d$,":[271],"$O(k(\\frac{\\widetilde{T}}{n})^{d-\\frac{d}{d+1}})$-competitive,":[275],"$\\widetilde{T}$":[277],"median":[280],"lengths":[283],"since":[286],"were":[291],"last":[292],"known":[293],"precisely.":[294],"Matching":[295],"lower":[296],"demonstrate":[298],"cases,":[304],"optimally":[306],"competitive,":[307],"up":[308],"factors.":[311]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}
