{"id":"https://openalex.org/W2053681885","doi":"https://doi.org/10.1016/s0304-3975(98)00062-0","title":"Approximations for subset interconnection designs","display_name":"Approximations for subset interconnection designs","publication_year":1998,"publication_date":"1998-10-01","ids":{"openalex":"https://openalex.org/W2053681885","doi":"https://doi.org/10.1016/s0304-3975(98)00062-0","mag":"2053681885"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(98)00062-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(98)00062-0","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5100938515","display_name":"DU Xiu-feng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiufeng Du","raw_affiliation_strings":["Department of Mathematics, Qiqihar Teacher's College, Minneapolis, MN 55455, USA","Qiqihar Teacher's College, Minneapolis, MN#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Qiqihar Teacher's College, Minneapolis, MN 55455, USA","institution_ids":[]},{"raw_affiliation_string":"Qiqihar Teacher's College, Minneapolis, MN#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070037321","display_name":"Weili Wu","orcid":"https://orcid.org/0000-0001-8747-6340"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Weili Wu","raw_affiliation_strings":["Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, USA","University of Minnesota, Minneapolis,#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, USA","institution_ids":["https://openalex.org/I130238516"]},{"raw_affiliation_string":"University of Minnesota, Minneapolis,#TAB#","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044437457","display_name":"Dean Kelley","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dean F. Kelley","raw_affiliation_strings":["Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, USA","University of Minnesota, Minneapolis,#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, USA","institution_ids":["https://openalex.org/I130238516"]},{"raw_affiliation_string":"University of Minnesota, Minneapolis,#TAB#","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5070037321"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":1.0202,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.76627948,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"207","issue":"1","first_page":"171","last_page":"180"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T11797","display_name":"graph theory and CDMA systems","score":0.9987999796867371,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9984999895095825,"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/combinatorics","display_name":"Combinatorics","score":0.7063777446746826},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.663221538066864},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6310107111930847},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5034236311912537},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48913246393203735},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4867370128631592},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47094830870628357},{"id":"https://openalex.org/keywords/interconnection","display_name":"Interconnection","score":0.46547362208366394},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4567379653453827},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43619537353515625},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43356311321258545},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1893506646156311}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7063777446746826},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.663221538066864},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6310107111930847},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5034236311912537},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48913246393203735},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4867370128631592},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47094830870628357},{"id":"https://openalex.org/C123745756","wikidata":"https://www.wikidata.org/wiki/Q1665949","display_name":"Interconnection","level":2,"score":0.46547362208366394},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4567379653453827},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43619537353515625},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43356311321258545},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1893506646156311},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0304-3975(98)00062-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(98)00062-0","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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":12,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W1969940463","https://openalex.org/W1981890243","https://openalex.org/W2029828838","https://openalex.org/W2079473728","https://openalex.org/W2080022329","https://openalex.org/W2093139355","https://openalex.org/W2148417962","https://openalex.org/W2331229340","https://openalex.org/W2499247005","https://openalex.org/W2584216746","https://openalex.org/W6665191260"],"related_works":["https://openalex.org/W8653221","https://openalex.org/W2186461377","https://openalex.org/W2349211578","https://openalex.org/W2962917430","https://openalex.org/W1553492721","https://openalex.org/W1728611673","https://openalex.org/W2783170771","https://openalex.org/W2028468530","https://openalex.org/W2963355678","https://openalex.org/W3099328339"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}