{"id":"https://openalex.org/W2271584984","doi":"https://doi.org/10.1007/978-3-662-47666-6_54","title":"Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem","display_name":"Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2271584984","doi":"https://doi.org/10.1007/978-3-662-47666-6_54","mag":"2271584984"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-47666-6_54","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-47666-6_54","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/A5109108206","display_name":"Erez Kantor","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Erez Kantor","raw_affiliation_strings":["MIT CSAIL, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"MIT CSAIL, Cambridge, MA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033442948","display_name":"Shay Kutten","orcid":"https://orcid.org/0000-0003-2062-6855"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shay Kutten","raw_affiliation_strings":["Technion, 32000, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Technion, 32000, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109108206"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4627,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64665485,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"675","last_page":"687"},"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.9991999864578247,"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.9991999864578247,"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.9991999864578247,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7817264795303345},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7463757395744324},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6669206023216248},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6188645362854004},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.49735477566719055},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.45275306701660156},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4311390519142151},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42366737127304077},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.4162786304950714},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38940006494522095},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16770261526107788}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7817264795303345},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7463757395744324},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6669206023216248},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6188645362854004},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.49735477566719055},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.45275306701660156},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4311390519142151},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42366737127304077},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.4162786304950714},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38940006494522095},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16770261526107788},{"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/978-3-662-47666-6_54","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-47666-6_54","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1503993426","https://openalex.org/W1578824783","https://openalex.org/W1583496057","https://openalex.org/W1601518330","https://openalex.org/W1665378928","https://openalex.org/W1881248737","https://openalex.org/W1986461212","https://openalex.org/W1987230339","https://openalex.org/W1988808425","https://openalex.org/W2020112047","https://openalex.org/W2023472639","https://openalex.org/W2025845565","https://openalex.org/W2037408498","https://openalex.org/W2042492403","https://openalex.org/W2054695963","https://openalex.org/W2083390663","https://openalex.org/W2095265358","https://openalex.org/W2100322482","https://openalex.org/W2142301169","https://openalex.org/W2156183801","https://openalex.org/W2271584984","https://openalex.org/W2622763161","https://openalex.org/W4236722199"],"related_works":["https://openalex.org/W3000166930","https://openalex.org/W2469766240","https://openalex.org/W1999969615","https://openalex.org/W2595180148","https://openalex.org/W1787635289","https://openalex.org/W2127581878","https://openalex.org/W4302234255","https://openalex.org/W4289784632","https://openalex.org/W2950782984","https://openalex.org/W1665378928"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-01-15T23:16:33.117629","created_date":"2025-10-10T00:00:00"}
