{"id":"https://openalex.org/W203393659","doi":"https://doi.org/10.1007/978-3-319-04298-5_8","title":"Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem","display_name":"Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W203393659","doi":"https://doi.org/10.1007/978-3-319-04298-5_8","mag":"203393659"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-04298-5_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-04298-5_8","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5015428768","display_name":"Kfir Barhum","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Kfir Barhum","raw_affiliation_strings":["Department of Computer Science, ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015428768"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":6.3399,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.96814644,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"77","last_page":"88"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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.9969000220298767,"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.9909999966621399,"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.8625755310058594},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.750086784362793},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7429006695747375},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6107454895973206},{"id":"https://openalex.org/keywords/advice","display_name":"Advice (programming)","score":0.5636261105537415},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5254411101341248},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4994621276855469},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4919297695159912},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48443010449409485},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4826112985610962},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46954306960105896},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4332711100578308},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4310847818851471},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.41630250215530396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3896515369415283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22770506143569946},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.17560777068138123},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.14201760292053223}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8625755310058594},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.750086784362793},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7429006695747375},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6107454895973206},{"id":"https://openalex.org/C2779955035","wikidata":"https://www.wikidata.org/wiki/Q4686785","display_name":"Advice (programming)","level":2,"score":0.5636261105537415},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5254411101341248},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4994621276855469},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4919297695159912},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48443010449409485},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4826112985610962},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46954306960105896},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4332711100578308},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4310847818851471},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.41630250215530396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3896515369415283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22770506143569946},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.17560777068138123},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.14201760292053223},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-04298-5_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-04298-5_8","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"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/W1542204506","https://openalex.org/W1552828154","https://openalex.org/W1554718677","https://openalex.org/W1570791521","https://openalex.org/W1947002865","https://openalex.org/W1981114903","https://openalex.org/W2025845565","https://openalex.org/W2029437526","https://openalex.org/W2037408498","https://openalex.org/W2041645394","https://openalex.org/W2064147138","https://openalex.org/W2109659895"],"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/W2567853751"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}