{"id":"https://openalex.org/W1981890243","doi":"https://doi.org/10.1002/net.3230220406","title":"Two algorithms for the subset interconnection design problem","display_name":"Two algorithms for the subset interconnection design problem","publication_year":1992,"publication_date":"1992-07-01","ids":{"openalex":"https://openalex.org/W1981890243","doi":"https://doi.org/10.1002/net.3230220406","mag":"1981890243"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230220406","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220406","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/A5087315825","display_name":"Erich Prisner","orcid":"https://orcid.org/0000-0001-6521-5502"},"institutions":[{"id":"https://openalex.org/I20121455","display_name":"Bielefeld University","ror":"https://ror.org/02hpadn98","country_code":"DE","type":"education","lineage":["https://openalex.org/I20121455"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Erich Prisner","raw_affiliation_strings":["SFB 343, Diskrete Strukturen in der Mathematik, Universita\u0308t Bielefeld P.O.B. 8640, 4800 Bielefeld, Germany","SFB 343, Diskrete Strukturen in der Mathematik, Universit\u00e4t Bielefeld P.O.B. 8640, 4800 Bielefeld, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"SFB 343, Diskrete Strukturen in der Mathematik, Universita\u0308t Bielefeld P.O.B. 8640, 4800 Bielefeld, Germany","institution_ids":["https://openalex.org/I20121455"]},{"raw_affiliation_string":"SFB 343, Diskrete Strukturen in der Mathematik, Universit\u00e4t Bielefeld P.O.B. 8640, 4800 Bielefeld, Germany","institution_ids":["https://openalex.org/I20121455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087315825"],"corresponding_institution_ids":["https://openalex.org/I20121455"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.5295,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.62376359,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"22","issue":"4","first_page":"385","last_page":"395"},"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.996399998664856,"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.996399998664856,"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.9955000281333923,"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.991599977016449,"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.6126618385314941},{"id":"https://openalex.org/keywords/interconnection","display_name":"Interconnection","score":0.5784730315208435},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5779143571853638},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5677135586738586},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5404428243637085},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5075842142105103},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.49981117248535156},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4925761818885803},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.49169784784317017},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48972228169441223},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.43711310625076294},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.41910386085510254},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41339021921157837},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40021196007728577},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33749836683273315},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3065655827522278}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6126618385314941},{"id":"https://openalex.org/C123745756","wikidata":"https://www.wikidata.org/wiki/Q1665949","display_name":"Interconnection","level":2,"score":0.5784730315208435},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5779143571853638},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5677135586738586},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5404428243637085},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5075842142105103},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.49981117248535156},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4925761818885803},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.49169784784317017},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48972228169441223},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.43711310625076294},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.41910386085510254},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41339021921157837},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40021196007728577},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33749836683273315},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3065655827522278},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"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.1002/net.3230220406","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220406","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":10,"referenced_works":["https://openalex.org/W591604025","https://openalex.org/W1965680834","https://openalex.org/W1977951010","https://openalex.org/W1986022261","https://openalex.org/W1991477862","https://openalex.org/W2080022329","https://openalex.org/W2087216833","https://openalex.org/W2093139355","https://openalex.org/W2148417962","https://openalex.org/W4212835401"],"related_works":["https://openalex.org/W2081066931","https://openalex.org/W4318676427","https://openalex.org/W2049375542","https://openalex.org/W2556526414","https://openalex.org/W2174077876","https://openalex.org/W1511480398","https://openalex.org/W4242473996","https://openalex.org/W3187836939","https://openalex.org/W2963355678","https://openalex.org/W3208828666"],"abstract_inverted_index":{"Abstract":[0],"An":[1],"NP\u2010complete":[2],"generalization":[3],"of":[4,16,41,43,64,99,105],"the":[5,91,106],"minimum":[6,68,81],"spanning":[7],"tree":[8],"problem":[9,72,92],"is":[10,53,73],"considered.":[11],"Given":[12],"are":[13,93,115],"a":[14,19,31,61,76,80],"set":[15,51],"V":[17,23,25,44,52],",":[18,29,36],"cost":[20,82],"function":[21],"c:":[22],"\u00d7":[24],"\u2192":[26],"R":[27],"+":[28],"and":[30,95],"collection":[32],"{":[33],"X":[34,38,58],"1":[35],"\u2026,":[37],"m":[39],"}":[40],"subsets":[42],".":[45,66],"A":[46],"graph":[47,78],"G":[48,65],"with":[49,79],"vertex":[50],"called":[54],"feasible":[55,77],"if":[56],"every":[57],"i":[59],"induces":[60],"connected":[62],"subgraph":[63],"The":[67],"subset":[69],"interconnection":[70],"design":[71],"to":[74],"find":[75],"sum.":[83],"In":[84],"this":[85],"paper,":[86],"two":[87],"heuristic":[88],"algorithms":[89,107],"for":[90,102],"given":[94],"analyzed.":[96],"Several":[97],"classes":[98],"input":[100],"data":[101],"which":[103],"one":[104],"finds":[108],"optimal":[109],"or":[110],"at":[111],"least":[112],"approximative":[113],"solutions":[114],"presented.":[116]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}