{"id":"https://openalex.org/W2620451143","doi":"https://doi.org/10.1137/14098692x","title":"Online Node-weighted Steiner Forest and Extensions via Disk Paintings","display_name":"Online Node-weighted Steiner Forest and Extensions via Disk Paintings","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2620451143","doi":"https://doi.org/10.1137/14098692x","mag":"2620451143"},"language":"en","primary_location":{"id":"doi:10.1137/14098692x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14098692x","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/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"MohammadTaghi Hajiaghayi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055811592","display_name":"Vahid Liaghat","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vahid Liaghat","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5087182068","display_name":"Debmalya Panigrahi","orcid":"https://orcid.org/0000-0003-1799-6660"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Debmalya Panigrahi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111876448"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2371,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.55391277,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"46","issue":"3","first_page":"911","last_page":"935"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/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/T10374","display_name":"Advanced Graph Theory Research","score":0.9975000023841858,"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/competitive-analysis","display_name":"Competitive analysis","score":0.8163772225379944},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7116687297821045},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6785252094268799},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.67576003074646},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6640111207962036},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5506342649459839},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5206784009933472},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5187190175056458},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47019872069358826},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4533705711364746},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43836697936058044},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4373520016670227},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3678407073020935},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3513514995574951},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2814629077911377}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8163772225379944},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7116687297821045},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6785252094268799},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.67576003074646},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6640111207962036},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5506342649459839},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5206784009933472},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5187190175056458},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47019872069358826},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4533705711364746},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43836697936058044},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4373520016670227},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3678407073020935},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3513514995574951},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2814629077911377},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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},{"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.1137/14098692x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14098692x","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":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.6200000047683716}],"awards":[{"id":"https://openalex.org/G1129333050","display_name":null,"funder_award_id":"N000141110662","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G3370747787","display_name":null,"funder_award_id":"FA8650-11-1- 7162","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G4425768753","display_name":null,"funder_award_id":"1053605","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"},{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1963899113","https://openalex.org/W1967546560","https://openalex.org/W1967641001","https://openalex.org/W1973444128","https://openalex.org/W1981114903","https://openalex.org/W1983369141","https://openalex.org/W1991636386","https://openalex.org/W2001139415","https://openalex.org/W2009976792","https://openalex.org/W2010912147","https://openalex.org/W2011823863","https://openalex.org/W2029437526","https://openalex.org/W2037408498","https://openalex.org/W2046554800","https://openalex.org/W2047723482","https://openalex.org/W2047993669","https://openalex.org/W2056152695","https://openalex.org/W2074121653","https://openalex.org/W4206478994","https://openalex.org/W4239610380"],"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/W2086365412"],"abstract_inverted_index":{"We":[0,139],"give":[1],"the":[2,8,32,117],"first":[3],"polynomial-time":[4],"online":[5,61,85,99,149],"algorithm":[6,23],"for":[7,74,98,147],"node-weighted":[9],"Steiner":[10],"forest":[11],"problem":[12],"with":[13,37],"a":[14,28,47,56,59,75,95,123,135],"poly-logarithmic":[15],"competitive":[16,19,49],"ratio.":[17],"The":[18,108],"ratio":[20],"of":[21,35,71,78,119,125,137],"our":[22],"is":[24,52,114],"optimal":[25,53],"up":[26,54],"to":[27,55,115,122],"logarithmic":[29,48],"factor.":[30],"For":[31],"special":[33,69],"case":[34],"graphs":[36],"an":[38],"excluded":[39],"fixed":[40],"minor":[41],"(e.g.,":[42],"planar":[43],"graphs),":[44],"we":[45,104],"obtain":[46],"ratio,":[50],"which":[51],"constant,":[57],"using":[58,94],"different":[60],"algorithm.":[62],"Both":[63],"these":[64],"results":[65,73,90],"are":[66,91],"obtained":[67,92],"as":[68,84],"cases":[70],"generic":[72],"large":[76],"class":[77],"problems":[79,102],"that":[80,103,141],"can":[81],"be":[82,145],"encoded":[83],"$\\{0,":[86],"1\\}$-proper":[87],"functions.":[88],"Our":[89],"by":[93],"new":[96],"framework":[97,143],"network":[100,150],"design":[101,151],"call":[105],"disk":[106],"paintings.":[107],"central":[109],"idea":[110],"in":[111],"this":[112,142],"technique":[113],"amortize":[116],"cost":[118],"primal":[120],"updates":[121],"set":[124],"carefully":[126],"selected":[127],"mutually":[128],"disjoint":[129],"fixed-radius":[130],"dual":[131],"disks":[132],"centered":[133],"at":[134],"subset":[136],"terminals.":[138],"hope":[140],"will":[144],"useful":[146],"other":[148],"problems.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-22T08:38:42.863108","created_date":"2025-10-10T00:00:00"}