{"id":"https://openalex.org/W2036299754","doi":"https://doi.org/10.1016/s0020-0190(01)00323-4","title":"A note on practical construction of maximum bandwidth paths","display_name":"A note on practical construction of maximum bandwidth paths","publication_year":2002,"publication_date":"2002-08-01","ids":{"openalex":"https://openalex.org/W2036299754","doi":"https://doi.org/10.1016/s0020-0190(01)00323-4","mag":"2036299754"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(01)00323-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(01)00323-4","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","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/A5034540286","display_name":"Navneet Malpani","orcid":null},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Navneet Malpani","raw_affiliation_strings":["Intel Corporation, 505 E. Huntland Dr., Suite 550, Austin, TX 78752, USA","Intel Corporation, 505 E. Huntland Dr., Suite 550, Austin, TX"],"affiliations":[{"raw_affiliation_string":"Intel Corporation, 505 E. Huntland Dr., Suite 550, Austin, TX 78752, USA","institution_ids":["https://openalex.org/I1343180700"]},{"raw_affiliation_string":"Intel Corporation, 505 E. Huntland Dr., Suite 550, Austin, TX","institution_ids":["https://openalex.org/I1343180700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023394727","display_name":"Jianer Chen","orcid":"https://orcid.org/0000-0003-0898-1643"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jianer Chen","raw_affiliation_strings":["Department of Computer Science, Texas A&M University, College Station, TX 77843-3112, USA","Department of Computer Science, Texas A&M University College Station, TX#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, College Station, TX 77843-3112, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Computer Science, Texas A&M University College Station, TX#TAB#","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023394727"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":1.3855,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.84593156,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"83","issue":"3","first_page":"175","last_page":"180"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","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/T10138","display_name":"Network Traffic and Congestion Control","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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9995999932289124,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.998199999332428,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8411346077919006},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.7450833320617676},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6751066446304321},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.569847047328949},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.507026195526123},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5064069032669067},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.47152790427207947},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43465837836265564},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42332905530929565},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.40497201681137085},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2644006609916687},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1952584683895111},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1877795159816742},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1651397943496704},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16104984283447266}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8411346077919006},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.7450833320617676},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6751066446304321},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.569847047328949},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.507026195526123},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5064069032669067},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.47152790427207947},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43465837836265564},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42332905530929565},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.40497201681137085},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2644006609916687},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1952584683895111},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1877795159816742},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1651397943496704},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16104984283447266}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0020-0190(01)00323-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(01)00323-4","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","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":14,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1737589985","https://openalex.org/W1982512167","https://openalex.org/W2084224084","https://openalex.org/W2096774592","https://openalex.org/W2111022489","https://openalex.org/W2112169033","https://openalex.org/W2120608001","https://openalex.org/W2130202407","https://openalex.org/W2149342630","https://openalex.org/W2243986870","https://openalex.org/W2752885492","https://openalex.org/W6637732671","https://openalex.org/W6677853904"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}