{"id":"https://openalex.org/W2163668690","doi":"https://doi.org/10.1002/net.3230180108","title":"Convexity and the Steiner tree problem","display_name":"Convexity and the Steiner tree problem","publication_year":1988,"publication_date":"1988-03-01","ids":{"openalex":"https://openalex.org/W2163668690","doi":"https://doi.org/10.1002/net.3230180108","mag":"2163668690"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230180108","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230180108","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5005781105","display_name":"J. Scott Provan","orcid":null},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. Scott Provan","raw_affiliation_strings":["Department of Operations Research, University of North Carolina at Chapel Hill, Chapel Hill, North Carolina 27514"],"affiliations":[{"raw_affiliation_string":"Department of Operations Research, University of North Carolina at Chapel Hill, Chapel Hill, North Carolina 27514","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005781105"],"corresponding_institution_ids":["https://openalex.org/I114027177"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":6.3447,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.96760454,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"18","issue":"1","first_page":"55","last_page":"72"},"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.9998000264167786,"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.9998000264167786,"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.9901000261306763,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9872999787330627,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9566256999969482},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.8235934972763062},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.703334391117096},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6471985578536987},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5874474048614502},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5714321732521057},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5240635871887207},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5222497582435608},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42096221446990967},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34370023012161255},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3305370509624481},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3097664713859558},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.07009163498878479},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05411675572395325},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05275624990463257}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9566256999969482},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.8235934972763062},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.703334391117096},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6471985578536987},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5874474048614502},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5714321732521057},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5240635871887207},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5222497582435608},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42096221446990967},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34370023012161255},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3305370509624481},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3097664713859558},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.07009163498878479},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05411675572395325},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05275624990463257},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230180108","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230180108","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1528622396","https://openalex.org/W1965701993","https://openalex.org/W1975290397","https://openalex.org/W1976021853","https://openalex.org/W1990488643","https://openalex.org/W1996668544","https://openalex.org/W2007572995","https://openalex.org/W2011039300","https://openalex.org/W2012846528","https://openalex.org/W2020112047","https://openalex.org/W2022150791","https://openalex.org/W2025299767","https://openalex.org/W2042477130","https://openalex.org/W2048013200","https://openalex.org/W2049637478","https://openalex.org/W2060380213","https://openalex.org/W2064086982","https://openalex.org/W2069712919","https://openalex.org/W2085242823","https://openalex.org/W2086709935","https://openalex.org/W2104734478","https://openalex.org/W2115616619","https://openalex.org/W2132087752","https://openalex.org/W2150855695","https://openalex.org/W2156503228","https://openalex.org/W2168570149","https://openalex.org/W2401610261","https://openalex.org/W3127447045","https://openalex.org/W4238006633"],"related_works":["https://openalex.org/W974563791","https://openalex.org/W2739242419","https://openalex.org/W1595291551","https://openalex.org/W4244816249","https://openalex.org/W2183636263","https://openalex.org/W2999680961","https://openalex.org/W1992362850","https://openalex.org/W2050428285","https://openalex.org/W2096702260","https://openalex.org/W2949081670"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"investigate":[2],"the":[3,8,12,33,40,47,54,77,82,91],"role":[4],"convexity":[5],"plays":[6],"in":[7],"efficient":[9],"solution":[10],"to":[11,30,35,70,100],"Steiner":[13,23,48,56,79,84],"tree":[14,24,49,57,85],"problem.":[15],"In":[16],"general":[17],"terms,":[18],"we":[19,59,87],"show":[20,88],"that":[21,89],"a":[22,43,72,102],"problem":[25,50],"is":[26,68,98],"always":[27],"computationally":[28],"easier":[29],"solve":[31],"when":[32],"points":[34],"be":[36],"connected":[37],"lie":[38],"on":[39,51],"boundary":[41],"of":[42,62,94],"\u201cconvex\u201d":[44],"region.":[45],"For":[46,81],"graphs":[52],"and":[53],"rectilinear":[55],"problem,":[58,86],"give":[60],"definitions":[61],"\u201cconvexity\u201d":[63],"for":[64,75,90],"which":[65],"this":[66,96],"condition":[67,97],"sufficient":[69,99],"allow":[71,101],"polynomial":[73,104],"algorithm":[74],"finding":[76],"optimal":[78],"tree.":[80],"classical":[83],"standard":[92],"definition":[93],"convexity,":[95],"fully":[103],"approximation":[105],"scheme.":[106]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}