{"id":"https://openalex.org/W2164903952","doi":"https://doi.org/10.1007/s00453-012-9701-z","title":"Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation","display_name":"Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation","publication_year":2012,"publication_date":"2012-10-22","ids":{"openalex":"https://openalex.org/W2164903952","doi":"https://doi.org/10.1007/s00453-012-9701-z","mag":"2164903952"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-012-9701-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9701-z","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/A5111545821","display_name":"Jochen K\u00f6nemann","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jochen K\u00f6nemann","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006200442","display_name":"Ojas Parekh","orcid":"https://orcid.org/0000-0003-2689-9264"},"institutions":[{"id":"https://openalex.org/I4210104735","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ojas Parekh","raw_affiliation_strings":["Sandia National Laboratories, Albuquerque, NM, USA"],"affiliations":[{"raw_affiliation_string":"Sandia National Laboratories, Albuquerque, NM, USA","institution_ids":["https://openalex.org/I4210104735"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076855240","display_name":"David Pritchard","orcid":"https://orcid.org/0000-0002-1405-6852"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David Pritchard","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5076855240"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.17658296,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"68","issue":"3","first_page":"776","last_page":"804"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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/T12288","display_name":"Optimization and Search Problems","score":0.9968000054359436,"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/mathematics","display_name":"Mathematics","score":0.799156665802002},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6947459578514099},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6407800912857056},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6315497159957886},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5408526062965393},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49452993273735046},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.46641290187835693},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4557274878025055},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.4511021673679352},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4357348084449768},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4138169586658478},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.41322970390319824},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3453769087791443},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.2419911026954651},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19657769799232483},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15926489233970642}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.799156665802002},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6947459578514099},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6407800912857056},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6315497159957886},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5408526062965393},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49452993273735046},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.46641290187835693},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4557274878025055},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.4511021673679352},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4357348084449768},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4138169586658478},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.41322970390319824},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3453769087791443},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2419911026954651},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19657769799232483},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15926489233970642},{"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.1007/s00453-012-9701-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9701-z","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W37721340","https://openalex.org/W1531964914","https://openalex.org/W1532118422","https://openalex.org/W1534963672","https://openalex.org/W1548400851","https://openalex.org/W1548808492","https://openalex.org/W1574334008","https://openalex.org/W1608651920","https://openalex.org/W1752817158","https://openalex.org/W1843974934","https://openalex.org/W1969310934","https://openalex.org/W1969675191","https://openalex.org/W1980842804","https://openalex.org/W1985807147","https://openalex.org/W1998824135","https://openalex.org/W2003160050","https://openalex.org/W2005633226","https://openalex.org/W2019062750","https://openalex.org/W2022191808","https://openalex.org/W2034269606","https://openalex.org/W2052340714","https://openalex.org/W2055505431","https://openalex.org/W2062075466","https://openalex.org/W2064779029","https://openalex.org/W2073800226","https://openalex.org/W2083162966","https://openalex.org/W2122997342","https://openalex.org/W2127719709","https://openalex.org/W2140322654","https://openalex.org/W2157421865","https://openalex.org/W2160146903","https://openalex.org/W2161190897","https://openalex.org/W2164286571","https://openalex.org/W2170344325","https://openalex.org/W2172955861","https://openalex.org/W2340149117","https://openalex.org/W2412657279","https://openalex.org/W2486816054","https://openalex.org/W2891873695","https://openalex.org/W2988480584","https://openalex.org/W3034528871","https://openalex.org/W3211107985","https://openalex.org/W4240507476","https://openalex.org/W6601597184"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W132011890","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W2004321562","https://openalex.org/W3184075718","https://openalex.org/W328736688","https://openalex.org/W2014979132"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}