"Multicommodity max-flow min-cut theorems and their use in designing ..."

Frank Thomson Leighton, Satish Rao (1999)

> Home

Details and statistics

DOI: 10.1145/331524.331526

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/LeightonR99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/LeightonR99
Frank Thomson Leighton, Satish Rao:
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6): 787-832 (1999)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.