{"id":"https://openalex.org/W2259315298","doi":"https://doi.org/10.1137/140955276","title":"The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online","display_name":"The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2259315298","doi":"https://doi.org/10.1137/140955276","mag":"2259315298"},"language":"en","primary_location":{"id":"doi:10.1137/140955276","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140955276","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/A5025386668","display_name":"Albert Gu","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Albert Gu","raw_affiliation_strings":["Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078381067","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029407896","display_name":"Amit Kumar","orcid":"https://orcid.org/0000-0002-3965-6627"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Amit Kumar","raw_affiliation_strings":["Dept. of Computer Science and Engg., IIT Delhi, India 110016"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engg., IIT Delhi, India 110016","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1398,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.83253191,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"45","issue":"1","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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.9998999834060669,"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.9994999766349792,"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.9962000250816345,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8690358400344849},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7197738885879517},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6480055451393127},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5030950903892517},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5005772113800049},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.4927819073200226},{"id":"https://openalex.org/keywords/swap","display_name":"Swap (finance)","score":0.47377586364746094},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45740842819213867},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4545029103755951},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4349323511123657},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.367376446723938},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23884636163711548},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.13206800818443298}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8690358400344849},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7197738885879517},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6480055451393127},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5030950903892517},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5005772113800049},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4927819073200226},{"id":"https://openalex.org/C99821215","wikidata":"https://www.wikidata.org/wiki/Q1136583","display_name":"Swap (finance)","level":2,"score":0.47377586364746094},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45740842819213867},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4545029103755951},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4349323511123657},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.367376446723938},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23884636163711548},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.13206800818443298},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/140955276","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140955276","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:oai:repository.cmu.edu:compsci-3622","is_oa":false,"landing_page_url":"http://repository.cmu.edu/compsci/2586","pdf_url":null,"source":{"id":"https://openalex.org/S4306400668","display_name":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Department","raw_type":"text"},{"id":"pmh:doi:10.1184/r1/6610730","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal contribution"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.413.9630","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.413.9630","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~anupamg/papers/stoc13-oneswap.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.434.5642","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.434.5642","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.iitd.ac.in/~amitk/online-recourse.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.742.7000","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.742.7000","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1307.3757.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3269144072","display_name":"DC: Medium: Designing and Programming a Low-Power Cluster Architecture for Data-Intensive Workloads","funder_award_id":"0964474","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6835921093","display_name":"AF: Small: Future Directions in Approximation Algorithms Research","funder_award_id":"1016799","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":12,"referenced_works":["https://openalex.org/W1654197113","https://openalex.org/W1981114903","https://openalex.org/W1993260581","https://openalex.org/W2001139415","https://openalex.org/W2011823863","https://openalex.org/W2016757663","https://openalex.org/W2021247612","https://openalex.org/W2025845565","https://openalex.org/W2029437526","https://openalex.org/W2037408498","https://openalex.org/W2161965494","https://openalex.org/W4206478994"],"related_works":["https://openalex.org/W2161182859","https://openalex.org/W2118320476","https://openalex.org/W1503036335","https://openalex.org/W2025658531","https://openalex.org/W4244816249","https://openalex.org/W2115973883","https://openalex.org/W2739242419","https://openalex.org/W4390751688","https://openalex.org/W1967209836","https://openalex.org/W2165839536"],"abstract_inverted_index":{"In":[0,172],"the":[1,30,38,54,66,73,81,95,119,138,141,145,151,159,209,214,227,231,242,275,280],"online":[2],"Steiner":[3,67],"tree":[4,59,68,110,186,252],"problem,":[5],"a":[6,14,23,45,58,91,109,123,129,156,176,238,250,289],"sequence":[7],"of":[8,41,98,180,185,230,244,270,277],"points":[9,194],"is":[10,62,72,112,154,165,226],"revealed":[11],"one-by-one:":[12],"when":[13],"point":[15,28,143],"arrives,":[16],"we":[17,34,84,86,101,174,205],"only":[18,128,155],"have":[19,87],"time":[20,88],"to":[21,29,36,80,89,136,144,203,236],"add":[22],"single":[24,92,130],"edge":[25,83,93,139,210],"connecting":[26,140],"this":[27,71,116,259,294],"previous":[31,96,146,169],"ones,":[32],"and":[33,70,148,183,195,233],"want":[35],"minimize":[37],"total":[39],"length":[40],"edges":[42],"added.":[43],"Here,":[44],"tight":[46,291],"bound":[47,240],"has":[48],"been":[49],"known":[50],"for":[51,258,272,293],"two":[52],"decades:":[53],"greedy":[55],"algorithm":[56,125,263],"maintains":[57],"whose":[60],"cost":[61,153],"$O(\\log":[63],"n)$":[64],"times":[65,158],"cost,":[69],"best":[74],"possible.":[75],"But":[76],"suppose,":[77],"in":[78,118,279],"addition":[79,135],"new":[82,142],"add,":[85],"change":[90,223],"from":[94,168],"set":[97],"edges:":[99],"can":[100,206],"do":[102,197],"much":[103],"better?":[104],"Can":[105],"we,":[106],"e.g.,":[107],"maintain":[108],"that":[111,126,150,218,264],"constant-competitive?":[113],"We":[114,121,286],"answer":[115],"question":[117],"affirmative.":[120],"give":[122,175,237,288],"primal-dual":[124],"makes":[127],"swap":[131],"per":[132,246],"step":[133],"(in":[134,201],"adding":[137],"ones),":[147],"such":[149],"tree's":[152],"constant":[157,268],"optimal":[160],"cost.":[161],"Our":[162],"dual-based":[163],"analysis":[164,292],"quite":[166],"different":[167],"primal-only":[170],"analyses.":[171],"particular,":[173],"correspondence":[177],"between":[178],"radii":[179,221],"dual":[181,189,215,220],"balls":[182,190],"lengths":[184,211],"edges;":[187],"since":[188],"are":[191],"associated":[192],"with":[193],"hence":[196],"not":[198],"move":[199],"around":[200],"contrast":[202],"edges),":[204],"closely":[207],"monitor":[208],"based":[212],"on":[213,241],"radii.":[216],"Showing":[217],"these":[219],"cannot":[222],"too":[224],"rapidly":[225],"technical":[228],"heart":[229],"paper":[232],"allows":[234],"us":[235],"hard":[239],"number":[243,269,276],"swaps":[245,278],"arrival,":[247],"while":[248],"maintaining":[249],"constant-competitive":[251],"at":[253],"all":[254],"times.":[255],"Previous":[256],"results":[257],"problem":[260],"gave":[261],"an":[262,266],"performed":[265],"amortized":[267,295],"swaps:":[271],"each":[273],"$n$,":[274],"first":[281],"$n$":[282],"steps":[283],"was":[284],"$O(n)$.":[285],"also":[287],"simpler":[290],"case.":[296]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}