{"id":"https://openalex.org/W2788788124","doi":"https://doi.org/10.1142/s0129054117500290","title":"The Bursty Steiner Tree Problem","display_name":"The Bursty Steiner Tree Problem","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W2788788124","doi":"https://doi.org/10.1142/s0129054117500290","mag":"2788788124"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054117500290","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054117500290","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5002981812","display_name":"Gokarna Sharma","orcid":"https://orcid.org/0000-0002-4930-4609"},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gokarna Sharma","raw_affiliation_strings":["Department of Computer Science, Kent State University, Kent, OH 44242, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Kent State University, Kent, OH 44242, USA","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044907189","display_name":"Costas Busch","orcid":"https://orcid.org/0000-0002-4381-4333"},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Costas Busch","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Louisiana State University, Baton Rouge, LA 70803, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Louisiana State University, Baton Rouge, LA 70803, USA","institution_ids":["https://openalex.org/I121820613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002981812"],"corresponding_institution_ids":["https://openalex.org/I149910238"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24422754,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"28","issue":"07","first_page":"869","last_page":"887"},"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.9995999932289124,"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.9995999932289124,"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.9995999932289124,"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.9905999898910522,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9359474182128906},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7182146906852722},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.707074761390686},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6131494641304016},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6004524230957031},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5792618989944458},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.56843501329422},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5377175807952881},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4577753245830536},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.3505440354347229},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.22656413912773132}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9359474182128906},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7182146906852722},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.707074761390686},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6131494641304016},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6004524230957031},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5792618989944458},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.56843501329422},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5377175807952881},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4577753245830536},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.3505440354347229},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.22656413912773132},{"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.1142/s0129054117500290","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054117500290","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1976584101","https://openalex.org/W1990065565","https://openalex.org/W1992573093","https://openalex.org/W2011039300","https://openalex.org/W2025002613","https://openalex.org/W2029437526","https://openalex.org/W2041645394","https://openalex.org/W2070664846","https://openalex.org/W2084876869","https://openalex.org/W2087043915","https://openalex.org/W2089269509","https://openalex.org/W2140951480","https://openalex.org/W2170208937","https://openalex.org/W2610052675","https://openalex.org/W3127447045"],"related_works":["https://openalex.org/W4390751688","https://openalex.org/W2107381954","https://openalex.org/W1967209836","https://openalex.org/W1524393328","https://openalex.org/W2165839536","https://openalex.org/W2739242419","https://openalex.org/W4244816249","https://openalex.org/W2150253898","https://openalex.org/W1595291551","https://openalex.org/W2183636263"],"abstract_inverted_index":{"We":[0,139],"introduce":[1],"and":[2,46,94,135,190],"study":[3],"a":[4,59,67,117,124,143,158,178],"new":[5,17],"Steiner":[6,13,32,50,164,180],"tree":[7,14,33,51,165,181],"problem":[8,15,26,34,52,122,182],"variation":[9,160,183],"called":[10],"the":[11,29,36,48,55,75,86,99,132,136,151,162,169],"bursty":[12,159],"where":[16,81],"nodes":[18,39,56,90],"arrive":[19],"into":[20],"bursts.":[21,104],"This":[22],"is":[23,43,85,98],"an":[24],"online":[25,31,189],"which":[27],"becomes":[28,47],"well-known":[30],"if":[35,53],"number":[37,88,101],"of":[38,70,89,102,108,126,146,161,187],"in":[40,58],"each":[41],"burst":[42],"exactly":[44],"one":[45],"classic":[49,191],"all":[54],"appear":[57],"single":[60],"burst.":[61],"In":[62,105],"undirected":[63],"graphs,":[64],"we":[65,115],"provide":[66,116,173],"tight":[68,144],"bound":[69,134,145],"[Formula:":[71,82,95,112,127,147],"see":[72,83,96,113,128,148],"text]":[73,84,97,129,149],"on":[74,150],"competitive":[76,118,152],"ratio":[77,119,153],"for":[78,120,157,177],"this":[79,121],"problem,":[80],"total":[87,100],"to":[91],"be":[92,155],"connected":[93],"different":[103],"directed":[106],"graphs":[107],"bounded":[109],"edge":[110],"asymmetry":[111],"text],":[114],"with":[123],"gap":[125],"factor":[130],"between":[131],"lower":[133],"upper":[137],"bound.":[138],"also":[140],"show":[141],"that":[142,172,184],"can":[154],"obtained":[156],"terminal":[163],"problem.":[166],"These":[167],"are":[168],"first":[170],"results":[171],"clear":[174],"performance":[175],"trade-offs":[176],"novel":[179],"subsumes":[185],"both":[186],"its":[188],"versions.":[192]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}