Maximum Concurrent Flow is a network flow optimization problem that belongs to the class of multicommodity flow problems, distinguished by its objective of maximizing the minimum fraction of demand satisfied across all source-sink pairs simultaneously in a given capacitated network.
44
Publications
3.3K
Citations
89
Authors
56
Institutions
Publications per year
2017–2026
3
Parents
Publications
44
The maximum concurrent flow problem
Farhad Shahrokhi, David W. Matula · Journal of the ACM · 1990 · 437 citations · Full text
Natural Sciences, Computer Engineering, Computer Science +17
1–5 of 44
Authors
89
- DB
3
h-index
- JAJonathan A. Kelner
Massachusetts Institute of Technology, United States
3 publications · 227 citations
3
h-index
- NG
3
h-index
- DW
3
h-index
- SK
2
h-index
1–5 of 89
Institutions
56
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
11 publications
801 citations
Columbia University
New York, United States
3 h-index
5 publications
173 citations
Centre National de la Recherche Scientifique
Paris, France
3 h-index
4 publications
126 citations
Southern Methodist University
Dallas, United States
3 h-index
6 publications
510 citations
King's College London
London, United Kingdom
3 h-index
6 publications
106 citations
University of Pennsylvania
Philadelphia, United States
2 h-index
2 publications
62 citations
IBM (United States)
Armonk, United States
2 h-index
2 publications
62 citations
Indian Institute of Technology Delhi
New Delhi, India
2 h-index
2 publications
589 citations
1–8 of 56
Venues
- SIAM Journal on Computing
3 publications · 612 citations
3
h-index
- SIAM Journal on Discrete Mathematics
3 publications · 381 citations
3
h-index
- Journal of the ACM
JACM · 2 publications · 482 citations
2
h-index
- Networks
2 publications · 34 citations
2
h-index
- Optimization Letters
2 publications · 25 citations
2
h-index
1–5