AAAAAA
Results:
1-10
|
Results: 10
Authors:
TARDOS E
Citation: E. Tardos, EDITORS FOREWORD, Journal of algorithms, 27(2), 1998, pp. 169-169
Authors:
KLEINBERG J
TARDOS E
Citation: J. Kleinberg et E. Tardos, APPROXIMATIONS FOR THE DISJOINT PATHS PROBLEM IN HIGH-DIAMETER PLANARNETWORKS, Journal of computer and system sciences (Print), 57(1), 1998, pp. 61-73
Authors:
KLEIN PN
PLOTKIN SA
RAO S
TARDOS E
Citation: Pn. Klein et al., APPROXIMATION ALGORITHMS FOR STEINER AND DIRECTED MULTICUTS, Journal of algorithms, 22(2), 1997, pp. 241-269
Authors:
PLOTKIN SA
SHMOYS DB
TARDOS E
Citation: Sa. Plotkin et al., FAST APPROXIMATION ALGORITHMS FOR FRACTIONAL PACKING AND COVERING PROBLEMS, Mathematics of operations research, 20(2), 1995, pp. 257-301
Authors:
LEIGHTON T
MAKEDON F
PLOTKIN S
STEIN C
TARDOS E
TRAGOUDAS S
Citation: T. Leighton et al., FAST APPROXIMATION ALGORITHMS FOR MULTICOMMODITY FLOW PROBLEMS, Journal of computer and system sciences, 50(2), 1995, pp. 228-243
Authors:
GUSFIELD D
TARDOS E
Citation: D. Gusfield et E. Tardos, A FASTER PARAMETRIC MINIMUM-CUT ALGORITHM, Algorithmica, 11(3), 1994, pp. 278-290
Authors:
KLEIN P
PLOTKIN S
STEIN C
TARDOS E
Citation: P. Klein et al., FASTER APPROXIMATION ALGORITHMS FOR THE UNIT CAPACITY CONCURRENT FLOWPROBLEM WITH APPLICATIONS TO ROUTING AND FINDING SPARSE CUTS, SIAM journal on computing, 23(3), 1994, pp. 466-487
Authors:
SHMOYS DB
TARDOS E
Citation: Db. Shmoys et E. Tardos, AN APPROXIMATION ALGORITHM FOR THE GENERALIZED ASSIGNMENT PROBLEM, Mathematical programming, 62(3), 1993, pp. 461-474
Authors:
ORLIN JB
PLOTKIN SA
TARDOS E
Citation: Jb. Orlin et al., POLYNOMIAL DUAL NETWORK SIMPLEX ALGORITHMS, Mathematical programming, 60(3), 1993, pp. 255-276
Authors:
TARDOS E
VAZIRANI VV
Citation: E. Tardos et Vv. Vazirani, IMPROVED BOUNDS FOR THE MAX-FLOW MIN-MULTICUT RATIO FOR PLANAR AND K(R,R)-FREE GRAPHS, Information processing letters, 47(2), 1993, pp. 77-80
Risultati:
1-10
|