Approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms

Annual Symposium on Foundations of Computer Science (Proceedings)

Volumn , Issue , 1988, Pages 422-431

  Leighton, Tom ^a   Rao, Satish ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; INTEGRATED CIRCUITS, VLSI; MATHEMATICAL PROGRAMMING; MATHEMATICAL TECHNIQUES--GRAPH THEORY;

APPROXIMATION ALGORITHMS; MINIMUM QUOTIENT SEPARATORS; MULTICOMMODITY FLOW PROBLEMS; PACKET ROUTING; VLSI LAYOUT AREA;

COMPUTER PROGRAMMING;

EID: 0024135198     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.1988.21958     Document Type: Conference Paper

References (19)