|
7716
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
295
|
The geometry of graphs and some of its algorithmic applications
– LINIAL, LONDON, et al.
- 1994
|
|
207
|
An approximate max-flow min-cut theorems for uniform multicommodity flow problem with applications to approximation algorithms
– Leighton, Rao
- 1988
|
|
165
|
On Lipschitz embedding of finite metric spaces in Hilbert space
– BOURGAIN
- 1985
|
|
162
|
Multi-commodity network flows
– Hu
- 1963
|
|
160
|
Fast approximation algorithms for multicommodity flow problems
– Leighton, Makedon, et al.
- 1995
|
|
131
|
Approximate Graph Coloring by Semidefinite Programming
– Karger, Motwani, et al.
- 1994
|
|
121
|
The maximum concurrent flow problem
– Shahrokhi, Matula
- 1990
|
|
111
|
Maximal flow through a network
– Ford, Fulkerson
- 1956
|
|
106
|
Approximate max-flow min-(multi)cut theorems and their applications
– Garg, Vazirani, et al.
|
|
98
|
Primal-dual approximation algorithms for integral flow and multicut in trees
– Garg, Vazirani, et al.
- 1997
|
|
78
|
Excluded minors, network decomposition, and multicommodity flow
– Klein, Plotkin, et al.
- 1993
|
|
66
|
Multicommodity flows in planar graphs
– Okamura, Seymour
- 1981
|
|
65
|
878Approximation Algorithms for MAX CUT and MAX 2SAT
– Goemans, Williamson
- 1994
|
|
50
|
A short-cut potential reduction algorithm for linear programming
– Kaliski, Ye
- 1993
|
|
49
|
The complexity of multiway cuts
– Dahlhaus, Johnson, et al.
- 1992
|
|
44
|
Approximation through multicommodity flow
– Agrawal, Klein, et al.
- 1990
|
|
44
|
Explicit Construction of Concentrators
– Margulis
- 1973
|
|
35
|
Note on maximum flow through a network
– Elias, Feinstein, et al.
- 1956
|
|
27
|
Matroids and Multicommodity Flows
– Seymour
- 1981
|
|
21
|
Applications of cut polyhedra
– Deza, Laurent
- 1994
|
|
20
|
Combinatorial approaches to multiflow problems
– Lomonosov
- 1985
|
|
19
|
Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows
– PLOTKIN, TARDOS
- 1993
|
|
18
|
On two commodity network flows
– Rothschild, Whinston
- 1966
|
|
8
|
The cut cone, L embeddability, complexity, and multicommodity flows
– Avis, Deza
- 1991
|
|
8
|
VLSi partitioning approximation algorithms based on multicommodity flow and other techniques
– Tragoudas
- 1991
|
|
4
|
A deterministic O(log k)-approximation algorithm for the sparsest cut
– Garg
- 1995
|
|
2
|
Flow Algorithms (in Russian
– Adelson-Welsky, Dinits, et al.
- 1975
|
|
2
|
Lois stables et espaces L p . Annales de l'Institut Henri Poincar'e
– Bretagnolle, Dacunha-Castelle, et al.
- 1966
|
|
2
|
Note on bi-Lipschitz embeddings into normed spaces
– Matousek
- 1992
|
|
2
|
Four terminous flows
– Seymour
- 1980
|
|
2
|
Embeddings and Extentions in Analysis
– Wells, Williams
- 1975
|
