{"id":"https://openalex.org/W2599142459","doi":"https://doi.org/10.1016/0020-0190(94)90044-2","title":"Designing multi-commodity flow trees","display_name":"Designing multi-commodity flow trees","publication_year":1994,"publication_date":"1994-04-01","ids":{"openalex":"https://openalex.org/W2599142459","doi":"https://doi.org/10.1016/0020-0190(94)90044-2","mag":"2599142459"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(94)90044-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)90044-2","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/cs/0205077","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042716179","display_name":"Samir Khuller","orcid":"https://orcid.org/0000-0002-5408-8023"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Samir Khuller","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD 20742, USA","Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046140110","display_name":"Balaji Raghavachari","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Balaji Raghavachari","raw_affiliation_strings":["Department of Computer Science, The University of Texas at Dallas, Box 830668, Richardson, TX 75083-0688, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Texas at Dallas, Box 830668, Richardson, TX 75083-0688, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006234305","display_name":"Neal E. Young","orcid":"https://orcid.org/0000-0001-8144-3345"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neal Young","raw_affiliation_strings":["Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042716179"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":{"value":2040,"currency":"USD","value_usd":2040},"apc_paid":null,"fwci":0.4669,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.69221817,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"50","issue":"1","first_page":"49","last_page":"55"},"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.9969000220298767,"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.9969000220298767,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9828000068664551,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9483000040054321,"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/separator","display_name":"Separator (oil production)","score":0.7583338022232056},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6733914017677307},{"id":"https://openalex.org/keywords/tree-network","display_name":"Tree network","score":0.6098845601081848},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.555825412273407},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5454767942428589},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.49082788825035095},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4766952693462372},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4418940842151642},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3552675247192383},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31004220247268677},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.29082804918289185},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11419010162353516}],"concepts":[{"id":"https://openalex.org/C185004128","wikidata":"https://www.wikidata.org/wiki/Q3011536","display_name":"Separator (oil production)","level":2,"score":0.7583338022232056},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6733914017677307},{"id":"https://openalex.org/C2781010653","wikidata":"https://www.wikidata.org/wiki/Q12056602","display_name":"Tree network","level":3,"score":0.6098845601081848},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.555825412273407},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5454767942428589},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.49082788825035095},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4766952693462372},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4418940842151642},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3552675247192383},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31004220247268677},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29082804918289185},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11419010162353516},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0020-0190(94)90044-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)90044-2","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"},{"id":"pmh:oai:arXiv.org:cs/0205077","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0205077","pdf_url":"https://arxiv.org/pdf/cs/0205077","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:cs/0205077","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0205077","pdf_url":"https://arxiv.org/pdf/cs/0205077","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1986207529","https://openalex.org/W2011039300","https://openalex.org/W2078196828","https://openalex.org/W2115049345","https://openalex.org/W2125278290","https://openalex.org/W4285719527","https://openalex.org/W6669907673","https://openalex.org/W6677232678"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W2098682899","https://openalex.org/W3161514703","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2610002854","https://openalex.org/W1974503539","https://openalex.org/W2044614658"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}