{"id":"https://openalex.org/W2028766782","doi":"https://doi.org/10.1007/pl00009310","title":"Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem","display_name":"Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem","publication_year":1997,"publication_date":"1997-07-01","ids":{"openalex":"https://openalex.org/W2028766782","doi":"https://doi.org/10.1007/pl00009310","mag":"2028766782"},"language":"en","primary_location":{"id":"doi:10.1007/pl00009310","is_oa":true,"landing_page_url":"https://doi.org/10.1007/pl00009310","pdf_url":"https://link.springer.com/content/pdf/10.1007/PL00009310.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/PL00009310.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056091722","display_name":"Ulrich F\u00f6\u00dfmeier","orcid":null},"institutions":[{"id":"https://openalex.org/I8087733","display_name":"University of T\u00fcbingen","ror":"https://ror.org/03a1kwz48","country_code":"DE","type":"education","lineage":["https://openalex.org/I8087733"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"U. F\u00f6\u00dfmeier","raw_affiliation_strings":["Wilhelm-Schickard-Institut f\u00fcr Informatik, Universit\u00e4t T\u00fcbingen, Sand 13, 72076 T\u00fcbingen, Germany  \\{foessmei,mk\\}@informatik.uni-tuebingen.de , , , , , , DE","Wilhelm-Schickard-Institut f\u00fcr Informatik, Universit\u00e4t T\u00fcbingen, Sand 13, 72076 T\u00fcbingen, Germany \\\\{foessmei,mk\\\\}@informatik.uni-tuebingen.de , DE"],"affiliations":[{"raw_affiliation_string":"Wilhelm-Schickard-Institut f\u00fcr Informatik, Universit\u00e4t T\u00fcbingen, Sand 13, 72076 T\u00fcbingen, Germany  \\{foessmei,mk\\}@informatik.uni-tuebingen.de , , , , , , DE","institution_ids":["https://openalex.org/I8087733"]},{"raw_affiliation_string":"Wilhelm-Schickard-Institut f\u00fcr Informatik, Universit\u00e4t T\u00fcbingen, Sand 13, 72076 T\u00fcbingen, Germany \\\\{foessmei,mk\\\\}@informatik.uni-tuebingen.de , DE","institution_ids":["https://openalex.org/I8087733"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103045561","display_name":"Michael Kaufmann","orcid":"https://orcid.org/0000-0001-9186-3538"},"institutions":[{"id":"https://openalex.org/I8087733","display_name":"University of T\u00fcbingen","ror":"https://ror.org/03a1kwz48","country_code":"DE","type":"education","lineage":["https://openalex.org/I8087733"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"M. Kaufmann","raw_affiliation_strings":["Wilhelm-Schickard-Institut f\u00fcr Informatik, Universit\u00e4t T\u00fcbingen, Sand 13, 72076 T\u00fcbingen, Germany  \\{foessmei,mk\\}@informatik.uni-tuebingen.de , , , , , , DE","Wilhelm-Schickard-Institut f\u00fcr Informatik, Universit\u00e4t T\u00fcbingen, Sand 13, 72076 T\u00fcbingen, Germany \\\\{foessmei,mk\\\\}@informatik.uni-tuebingen.de , DE"],"affiliations":[{"raw_affiliation_string":"Wilhelm-Schickard-Institut f\u00fcr Informatik, Universit\u00e4t T\u00fcbingen, Sand 13, 72076 T\u00fcbingen, Germany  \\{foessmei,mk\\}@informatik.uni-tuebingen.de , , , , , , DE","institution_ids":["https://openalex.org/I8087733"]},{"raw_affiliation_string":"Wilhelm-Schickard-Institut f\u00fcr Informatik, Universit\u00e4t T\u00fcbingen, Sand 13, 72076 T\u00fcbingen, Germany \\\\{foessmei,mk\\\\}@informatik.uni-tuebingen.de , DE","institution_ids":["https://openalex.org/I8087733"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072751459","display_name":"Alex Zelikovsky","orcid":"https://orcid.org/0000-0003-4424-4691"},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Zelikovsky","raw_affiliation_strings":["Department of Computer Science, University of Virginia, Charlottesville, VA 22903-2242, USA, , , , , , US","Department of Computer Science, University of Virginia, Charlottesville, VA 22903-2242, USA, US"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Virginia, Charlottesville, VA 22903-2242, USA, , , , , , US","institution_ids":["https://openalex.org/I51556381"]},{"raw_affiliation_string":"Department of Computer Science, University of Virginia, Charlottesville, VA 22903-2242, USA, US","institution_ids":["https://openalex.org/I51556381"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056091722"],"corresponding_institution_ids":["https://openalex.org/I8087733"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.0786,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.76557798,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"18","issue":"1","first_page":"93","last_page":"109"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"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"}},{"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9980000257492065,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8192077875137329},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7741169929504395},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7596931457519531},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6163257360458374},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5423169732093811},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5269960761070251},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.47848671674728394},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4646539092063904},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44167959690093994},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37979480624198914},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3723469376564026},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33432537317276},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.21557125449180603},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2026696503162384},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.11494624614715576}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8192077875137329},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7741169929504395},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7596931457519531},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6163257360458374},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5423169732093811},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5269960761070251},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.47848671674728394},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4646539092063904},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44167959690093994},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37979480624198914},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3723469376564026},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33432537317276},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.21557125449180603},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2026696503162384},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.11494624614715576}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/pl00009310","is_oa":true,"landing_page_url":"https://doi.org/10.1007/pl00009310","pdf_url":"https://link.springer.com/content/pdf/10.1007/PL00009310.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/pl00009310","is_oa":true,"landing_page_url":"https://doi.org/10.1007/pl00009310","pdf_url":"https://link.springer.com/content/pdf/10.1007/PL00009310.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2028766782.pdf"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W177621689","https://openalex.org/W1185775471","https://openalex.org/W1975140409","https://openalex.org/W1979630448","https://openalex.org/W1993553699","https://openalex.org/W2003882909","https://openalex.org/W2007918837","https://openalex.org/W2031671531","https://openalex.org/W2064086982","https://openalex.org/W2067651881","https://openalex.org/W2069712919","https://openalex.org/W2086709935","https://openalex.org/W2121473031","https://openalex.org/W2157338118","https://openalex.org/W2158598102","https://openalex.org/W2401610261","https://openalex.org/W3127447045","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1980288485","https://openalex.org/W1998126097","https://openalex.org/W2367195720","https://openalex.org/W2014979132","https://openalex.org/W1968497507","https://openalex.org/W3184075718","https://openalex.org/W2404561224","https://openalex.org/W1553492721","https://openalex.org/W1533142511","https://openalex.org/W4388857710"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}