{"id":"https://openalex.org/W1592986560","doi":"https://doi.org/10.1007/3-540-49543-6_22","title":"A High Performance Approximate Algorithm for the Steiner Problem in Graphs","display_name":"A High Performance Approximate Algorithm for the Steiner Problem in Graphs","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W1592986560","doi":"https://doi.org/10.1007/3-540-49543-6_22","mag":"1592986560"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-49543-6_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-49543-6_22","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/A5015092192","display_name":"P. Guitart","orcid":null},"institutions":[{"id":"https://openalex.org/I123044942","display_name":"Universitat Aut\u00f2noma de Barcelona","ror":"https://ror.org/052g8jq94","country_code":"ES","type":"education","lineage":["https://openalex.org/I123044942"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Pere Guitart","raw_affiliation_strings":["Departament d\u2019Inform\u00e0tica, Edifici C Universitat Aut\u00d2noma de Barcelona, 08193, Bellaterra, Catalunya, Spain","Departament d'Inform\u00e0tica, Edifici C Universitat Aut\u00d2noma de Barcelona, 08193, Bellaterra, Catalunya, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departament d\u2019Inform\u00e0tica, Edifici C Universitat Aut\u00d2noma de Barcelona, 08193, Bellaterra, Catalunya, Spain","institution_ids":["https://openalex.org/I123044942"]},{"raw_affiliation_string":"Departament d'Inform\u00e0tica, Edifici C Universitat Aut\u00d2noma de Barcelona, 08193, Bellaterra, Catalunya, Spain","institution_ids":["https://openalex.org/I123044942"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040058398","display_name":"Josep M. Basart","orcid":"https://orcid.org/0000-0002-2700-3901"},"institutions":[{"id":"https://openalex.org/I123044942","display_name":"Universitat Aut\u00f2noma de Barcelona","ror":"https://ror.org/052g8jq94","country_code":"ES","type":"education","lineage":["https://openalex.org/I123044942"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Josep M. Basart","raw_affiliation_strings":["Departament d\u2019Inform\u00e0tica, Edifici C Universitat Aut\u00d2noma de Barcelona, 08193, Bellaterra, Catalunya, Spain","Departament d'Inform\u00e0tica, Edifici C Universitat Aut\u00d2noma de Barcelona, 08193, Bellaterra, Catalunya, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departament d\u2019Inform\u00e0tica, Edifici C Universitat Aut\u00d2noma de Barcelona, 08193, Bellaterra, Catalunya, Spain","institution_ids":["https://openalex.org/I123044942"]},{"raw_affiliation_string":"Departament d'Inform\u00e0tica, Edifici C Universitat Aut\u00d2noma de Barcelona, 08193, Bellaterra, Catalunya, Spain","institution_ids":["https://openalex.org/I123044942"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.1273,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.84470247,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"280","last_page":"293"},"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.9994999766349792,"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.9980000257492065,"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.9160436391830444},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7439161539077759},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7434831857681274},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6402633786201477},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45603904128074646},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43998467922210693},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4309002459049225},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39422374963760376},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24219459295272827},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21202436089515686},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08176243305206299}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9160436391830444},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7439161539077759},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7434831857681274},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6402633786201477},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45603904128074646},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43998467922210693},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4309002459049225},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39422374963760376},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24219459295272827},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21202436089515686},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08176243305206299},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-49543-6_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-49543-6_22","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":10,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W109985799","https://openalex.org/W1581677344","https://openalex.org/W2038187549","https://openalex.org/W2049967755","https://openalex.org/W2115036101","https://openalex.org/W2163210218","https://openalex.org/W2575995598","https://openalex.org/W3127447045","https://openalex.org/W4252732074"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W2004321562","https://openalex.org/W3184075718","https://openalex.org/W328736688","https://openalex.org/W2995411114","https://openalex.org/W2404561224"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}