Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Leighton, Tom; Rao, I. Satish

doi:10.1145/331524.331526

Record: found
Abstract: not found
Article: not found

Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Author(s): Tom Leighton , Satish Rao

Publication date (Print): November 1999

Journal: Journal of the ACM

Publisher: Association for Computing Machinery (ACM)

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Journal

Title: Journal of the ACM

Abbreviated Title: J. ACM

Publisher: Association for Computing Machinery (ACM)

ISSN (Print): 00045411

Publication date (Print): November 1999

Volume: 46

Issue: 6

Pages: 787-832

Article

DOI: 10.1145/331524.331526

SO-VID: f0f8af34-6e27-4762-8fab-a84baada42ec

History

Data availability:

Comments

Comment on this article

scite_

Smart Citations

Citing PublicationsSupportingMentioningContrasting

View Citations

See how this article has been cited at scite.ai

scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.