{"id":"https://openalex.org/W2063395464","doi":"https://doi.org/10.1007/bf01758765","title":"Path-distance heuristics for the Steiner problem in undirected networks","display_name":"Path-distance heuristics for the Steiner problem in undirected networks","publication_year":1992,"publication_date":"1992-06-01","ids":{"openalex":"https://openalex.org/W2063395464","doi":"https://doi.org/10.1007/bf01758765","mag":"2063395464"},"language":"en","primary_location":{"id":"doi:10.1007/bf01758765","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01758765","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/A5030887041","display_name":"Pawe\u0142 Winter","orcid":"https://orcid.org/0000-0003-2669-0524"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Pawel Winter","raw_affiliation_strings":["Institute of Datalogy, University of Copenhagen, Universitetsparken 1, DK-2100, Copenhagen \u00d8, Denmark","Institute of Datalogy, University of Copenhagen, Copenhagen \u00d8, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Datalogy, University of Copenhagen, Universitetsparken 1, DK-2100, Copenhagen \u00d8, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"Institute of Datalogy, University of Copenhagen, Copenhagen \u00d8, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101974532","display_name":"J. MacGregor Smith","orcid":"https://orcid.org/0000-0002-6147-5806"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. MacGregor Smith","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, University of Massachusetts, 01003, Amherst, MA, USA","Department of Industrial Engineering and Operations Research, University of Massachusetts, Amherst, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of Massachusetts, 01003, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of Massachusetts, Amherst, USA","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":7.5902,"has_fulltext":false,"cited_by_count":100,"citation_normalized_percentile":{"value":0.97447199,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"7","issue":"1-6","first_page":"309","last_page":"327"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9261000156402588,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9258000254631042,"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/heuristics","display_name":"Heuristics","score":0.8170738220214844},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7314107418060303},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7172809839248657},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6544898152351379},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6191691160202026},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5937265753746033},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5352400541305542},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4802718162536621},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4266873598098755},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.42211073637008667},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4022708237171173},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35484057664871216},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33211833238601685},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26561975479125977},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17605185508728027}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8170738220214844},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7314107418060303},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7172809839248657},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6544898152351379},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6191691160202026},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5937265753746033},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5352400541305542},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4802718162536621},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4266873598098755},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.42211073637008667},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4022708237171173},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35484057664871216},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33211833238601685},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26561975479125977},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17605185508728027},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf01758765","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01758765","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"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/c29ec940-74cf-11db-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/c29ec940-74cf-11db-bee9-02004c4f4f50","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Winter , P & Smith , J M 1992 , ' Path-distance heuristics for the Steiner problem in undirected networks ' , Algorithmica , no. 7 , pp. 309-327 .","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1550399701","https://openalex.org/W1889632490","https://openalex.org/W1965680834","https://openalex.org/W1975290397","https://openalex.org/W1990317614","https://openalex.org/W1993553699","https://openalex.org/W1996668544","https://openalex.org/W2007503572","https://openalex.org/W2008771115","https://openalex.org/W2011039300","https://openalex.org/W2017927472","https://openalex.org/W2020586530","https://openalex.org/W2068362339","https://openalex.org/W2080156195","https://openalex.org/W2082150701","https://openalex.org/W2087598714","https://openalex.org/W2115036101","https://openalex.org/W2115616619","https://openalex.org/W2132087752","https://openalex.org/W2134143366","https://openalex.org/W2172222998","https://openalex.org/W2561675875","https://openalex.org/W2586554544","https://openalex.org/W3127447045","https://openalex.org/W3148632216","https://openalex.org/W3152126650","https://openalex.org/W4285719527","https://openalex.org/W6610378225"],"related_works":["https://openalex.org/W2118320476","https://openalex.org/W2161182859","https://openalex.org/W2025658531","https://openalex.org/W1503036335","https://openalex.org/W4244816249","https://openalex.org/W2115973883","https://openalex.org/W2739242419","https://openalex.org/W1970145791","https://openalex.org/W3131610618","https://openalex.org/W2361081252"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}