{"id":"https://openalex.org/W2000368618","doi":"https://doi.org/10.1007/pl00009266","title":"An O(n log n) Average Time Algorithm for Computing the Shortest Network under a Given Topology","display_name":"An O(n log n) Average Time Algorithm for Computing the Shortest Network under a Given Topology","publication_year":1999,"publication_date":"1999-04-01","ids":{"openalex":"https://openalex.org/W2000368618","doi":"https://doi.org/10.1007/pl00009266","mag":"2000368618"},"language":"en","primary_location":{"id":"doi:10.1007/pl00009266","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009266","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/A5039068720","display_name":"Guoliang Xue","orcid":"https://orcid.org/0000-0003-0703-8338"},"institutions":[{"id":"https://openalex.org/I111236770","display_name":"University of Vermont","ror":"https://ror.org/0155zta11","country_code":"US","type":"education","lineage":["https://openalex.org/I111236770"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"G. Xue","raw_affiliation_strings":["Department of Computer Science, The University of Vermont, Burlington, VT 05405, USA. xue@cs.uvm.edu, , , , , , US","UNIVERSITY OF VERMONT"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Vermont, Burlington, VT 05405, USA. xue@cs.uvm.edu, , , , , , US","institution_ids":["https://openalex.org/I111236770"]},{"raw_affiliation_string":"UNIVERSITY OF VERMONT","institution_ids":["https://openalex.org/I111236770"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037860988","display_name":"Ding\u2010Zhu Du","orcid":"https://orcid.org/0000-0002-7345-2185"},"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":"D.-Z. Du","raw_affiliation_strings":["Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, USA, dzd@cs.umn.edu, , , , , , US","Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, USA, dzd@cs.umn.edu, , US"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, USA, dzd@cs.umn.edu, , , , , , US","institution_ids":["https://openalex.org/I130238516"]},{"raw_affiliation_string":"Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, USA, dzd@cs.umn.edu, , US","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039068720"],"corresponding_institution_ids":["https://openalex.org/I111236770"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.4048,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.71567904,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"23","issue":"4","first_page":"354","last_page":"362"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/binary-logarithm","display_name":"Binary logarithm","score":0.6440097093582153},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6363288164138794},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5773208141326904},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5542002320289612},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5123992562294006},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.44188186526298523},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42096102237701416},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4202865958213806},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37509244680404663},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3616412580013275},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14361950755119324}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6440097093582153},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6363288164138794},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5773208141326904},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5542002320289612},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5123992562294006},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.44188186526298523},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42096102237701416},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4202865958213806},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37509244680404663},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3616412580013275},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14361950755119324}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/pl00009266","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009266","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W1975807353","https://openalex.org/W1988466537","https://openalex.org/W1990488643","https://openalex.org/W2012130001","https://openalex.org/W2021517364","https://openalex.org/W2060380213","https://openalex.org/W2086709935","https://openalex.org/W2096527938","https://openalex.org/W2110367141","https://openalex.org/W2157338118"],"related_works":["https://openalex.org/W2623150993","https://openalex.org/W2128262571","https://openalex.org/W2949384638","https://openalex.org/W4281386767","https://openalex.org/W2035930164","https://openalex.org/W4299009033","https://openalex.org/W2610086104","https://openalex.org/W2101461335","https://openalex.org/W1846361160","https://openalex.org/W2008836603"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
