{"id":"https://openalex.org/W3092788214","doi":"https://doi.org/10.1007/s00453-020-00768-6","title":"Non-Greedy Online Steiner Trees on Outerplanar Graphs","display_name":"Non-Greedy Online Steiner Trees on Outerplanar Graphs","publication_year":2020,"publication_date":"2020-10-16","ids":{"openalex":"https://openalex.org/W3092788214","doi":"https://doi.org/10.1007/s00453-020-00768-6","mag":"3092788214"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-020-00768-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-020-00768-6","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5052292825","display_name":"Akira Matsubayashi","orcid":"https://orcid.org/0000-0002-7861-4876"},"institutions":[{"id":"https://openalex.org/I10091056","display_name":"Kanazawa University","ror":"https://ror.org/02hwp6a56","country_code":"JP","type":"education","lineage":["https://openalex.org/I10091056"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Akira Matsubayashi","raw_affiliation_strings":["Division of Electrical Engineering and Computer Science, Kanazawa Univ., Kanazawa, 920-1192, Japan"],"affiliations":[{"raw_affiliation_string":"Division of Electrical Engineering and Computer Science, Kanazawa Univ., Kanazawa, 920-1192, Japan","institution_ids":["https://openalex.org/I10091056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052292825"],"corresponding_institution_ids":["https://openalex.org/I10091056"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.1612,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54856381,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"83","issue":"2","first_page":"613","last_page":"640"},"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.9987999796867371,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9912999868392944,"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.748759925365448},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7277024984359741},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6622599959373474},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.6576863527297974},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.532526969909668},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4808807671070099},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4752490222454071},{"id":"https://openalex.org/keywords/metric-dimension","display_name":"Metric dimension","score":0.46967512369155884},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4508105516433716},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.448022723197937},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4398324191570282},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4238014817237854},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.4102044999599457},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.2874276340007782},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27559977769851685},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22477933764457703},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.20986711978912354},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.20904064178466797},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.140379399061203},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06819471716880798}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.748759925365448},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7277024984359741},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6622599959373474},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.6576863527297974},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.532526969909668},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4808807671070099},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4752490222454071},{"id":"https://openalex.org/C60933471","wikidata":"https://www.wikidata.org/wiki/Q17152964","display_name":"Metric dimension","level":5,"score":0.46967512369155884},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4508105516433716},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.448022723197937},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4398324191570282},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4238014817237854},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.4102044999599457},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2874276340007782},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27559977769851685},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22477933764457703},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.20986711978912354},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.20904064178466797},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.140379399061203},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06819471716880798},{"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.1007/s00453-020-00768-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-020-00768-6","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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":18,"referenced_works":["https://openalex.org/W39921581","https://openalex.org/W48861618","https://openalex.org/W1557629339","https://openalex.org/W1972442117","https://openalex.org/W1981114903","https://openalex.org/W2000793193","https://openalex.org/W2025845565","https://openalex.org/W2029437526","https://openalex.org/W2030810980","https://openalex.org/W2032684479","https://openalex.org/W2037408498","https://openalex.org/W2046699917","https://openalex.org/W2056760235","https://openalex.org/W2058506754","https://openalex.org/W2147914448","https://openalex.org/W2398651089","https://openalex.org/W2561675875","https://openalex.org/W3153460966"],"related_works":["https://openalex.org/W1511821218","https://openalex.org/W2108770488","https://openalex.org/W1587078595","https://openalex.org/W2124176527","https://openalex.org/W2985636744","https://openalex.org/W2125058377","https://openalex.org/W2465927132","https://openalex.org/W4288110151","https://openalex.org/W2956577062","https://openalex.org/W1485639265"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}