Work

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

Year: 1988

Type: conference-paper

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/sfcs.1988.21958

Authors: T. Leighton, S. Rao

Institution: Massachusetts Institute of Technology

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2125278290

FWCI: 4.74

Cites: 14

Cited by: 411

Related to: 9