{"id":"https://openalex.org/W2136442119","doi":"https://doi.org/10.1137/s0097539701383443","title":"The Online Median Problem","display_name":"The Online Median Problem","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2136442119","doi":"https://doi.org/10.1137/s0097539701383443","mag":"2136442119"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539701383443","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701383443","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/A5063192197","display_name":"Ramgopal R. Mettu","orcid":"https://orcid.org/0000-0001-9479-9156"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]},{"id":"https://openalex.org/I4210166639","display_name":"Dartmouth Hospital","ror":"https://ror.org/02j3qj605","country_code":"GB","type":"healthcare","lineage":["https://openalex.org/I4210166639"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Ramgopal R. Mettu","raw_affiliation_strings":["Dartmouth College"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dartmouth College","institution_ids":["https://openalex.org/I107672454","https://openalex.org/I4210166639"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109574111","display_name":"C. Greg Plaxton","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"C. Greg Plaxton","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.1211,"has_fulltext":false,"cited_by_count":119,"citation_normalized_percentile":{"value":0.97788851,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"32","issue":"3","first_page":"816","last_page":"832"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","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"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9951000213623047,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9937999844551086,"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/online-algorithm","display_name":"Online algorithm","score":0.7624895572662354},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.7128633260726929},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6571016907691956},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6420520544052124},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6240395903587341},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5887928605079651},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5376327037811279},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5220691561698914},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4662329852581024},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.43447792530059814},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4227103590965271},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4107392132282257},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3508365750312805},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3028064966201782},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.15583482384681702}],"concepts":[{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7624895572662354},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.7128633260726929},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6571016907691956},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6420520544052124},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6240395903587341},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5887928605079651},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5376327037811279},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5220691561698914},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4662329852581024},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.43447792530059814},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4227103590965271},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4107392132282257},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3508365750312805},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3028064966201782},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.15583482384681702},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539701383443","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701383443","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1552828154","https://openalex.org/W1584983363","https://openalex.org/W1993553863","https://openalex.org/W2043097561","https://openalex.org/W2102815056","https://openalex.org/W2125005544","https://openalex.org/W2139841919","https://openalex.org/W2606195968","https://openalex.org/W2608158342","https://openalex.org/W4239875977","https://openalex.org/W4243637616","https://openalex.org/W4250828313"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"We":[0],"introduce":[1],"a":[2,45,47,107,129],"natural":[3],"variant":[4],"of":[5,27,60,73,89,92,98,167,228],"the":[6,14,19,24,30,35,39,57,81,86,90,111,122,138,150,161,195,238],"(metric":[7,139],"uncapacitated)":[8,140],"k-median":[9,20],"problem":[10,21,33,114,143],"that":[11,84,97,118,144,205,226],"we":[12,127,202,224],"call":[13],"online":[15,31,75,94,112],"median":[16,32,76,113],"problem.":[17],"Whereas":[18],"involves":[22],"optimizing":[23],"simultaneous":[25],"placement":[26,95],"k":[28],"facilities,":[29,201],"imposes":[34],"following":[36],"additional":[37],"constraints:":[38],"facilities":[40,61],"are":[41],"placed":[42],"one":[43],"at":[44],"time,":[46],"facility":[48,141,164],"cannot":[49],"be":[50,63,209],"moved":[51],"once":[52],"it":[53],"is":[54,66,78,106,119,156,174,187],"placed,":[55,64],"and":[56,169,177],"total":[58],"number":[59],"to":[62,79,96,160,193,200,211,213,233],"k,":[65],"not":[67],"known":[68],"in":[69,116,121,146,149,158],"advance.":[70],"The":[71,153],"objective":[72,220,240],"an":[74,93,99,179],"algorithm":[77,109,136,155,166],"minimize":[80,194],"competitive":[82],"ratio,":[83],"is,":[85],"worst-case":[87],"ratio":[88],"cost":[91],"optimal":[100],"offline":[101],"placement.":[102],"Our":[103],"main":[104],"result":[105],"constant-competitive":[108],"for":[110,137,217,237],"running":[115,181],"time":[117,147],"linear":[120,148],"input":[123,151],"size.":[124,152],"In":[125],"addition,":[126],"present":[128],"related,":[130],"though":[131],"substantially":[132],"simpler,":[133],"constant-factor":[134],"approximation":[135,230],"location":[142,165],"runs":[145],"latter":[154],"similar":[157],"spirit":[159],"recent":[162],"primal-dual-based":[163],"Jain":[168],"Vazirani,":[170],"but":[171],"our":[172,184,206,229],"approach":[173],"more":[175,218],"elementary":[176],"yields":[178],"improved":[180],"time.":[182],"While":[183],"primary":[185],"focus":[186],"on":[188],"problems":[189],"which":[190],"ask":[191],"us":[192],"weighted":[196],"average":[197],"service":[198],"distance":[199],"also":[203],"show":[204,225],"results":[207,231],"can":[208],"generalized":[210],"hold,":[212,232],"within":[214,234],"constant":[215,235],"factors,":[216,236],"general":[219],"functions.":[221],"For":[222],"example,":[223],"all":[227],"k-means":[239],"function.":[241]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}