(Almost) Tight bounds and existence theorems for single-commodity confluent flows

Journal of the ACM

Volumn 54, Issue 4, 2007, Pages

  Chen, Jiangzhuo ^a   Kleinberg, Robert D ^b   Lovász, László ^c   Rajaraman, Rajmohan ^d   Sundaram, Ravi ^d   Vetta, Adrian ^e  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

^b Department of Obstetrics Gynecology

^c EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^d NORTHEASTERN UNIVERSITY   (United States)

^e MCGILL UNIVERSITY   (Canada)

Author keywords

Approximation algorithms; Confluent flow; Network flow; Routing; Tight bounds

Indexed keywords

APPROXIMATION ALGORITHMS; HARDNESS; INTERNET; OPTIMIZATION; POLYNOMIALS; ROUTING ALGORITHMS;

COMMODITY; CONFLUENT FLOWS; NETWORKING; SPLITTABLE FLOW;

FLOW MEASUREMENT;

EID: 34547790932     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1255443.1255444     Document Type: Article

References (0)