|
|
eCommons@Cornell >
Browsing by Author Tardos, E.
Showing results 1 to 20 of 20
| Preview | Issue Date | Title | Author(s) | | Feb-1995 | Approximation Algorithms for Steiner and Directed Multicuts | Klein, P.; Plotkin, S.; Rao, S.; Tardos, E. |
| Mar-1995 | Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks | Kleinberg, J.; Tardos, E. |
| Aug-1990 | Computational complexity | Shmoys, D. B.; Tardos, E. |
| Jun-1995 | Disjoint Paths in Densely Embedded Graphs | Kleinberg, J.; Tardos, E. |
| Aug-1996 | Efficient Continuous-Time Dynamic Network Flow Algorithms | Fleischer, L.; Tardos, E. |
| Feb-1992 | Fast approximation algorithms for fractional packing and covering problems | Plotkin, S. A.; Shmoys, D.; Tardos, E. |
| Feb-1995 | Fast Approximation Algorithms for Multicommodity Flow Problems | Leighton, T.; Makedon, F.; Plotkin, S.; Stein, C.; Tardos, E.; Tragoudas, S. |
| Aug-1991 | Fast approximation algorithms for multicommodity flow problems | Leighton, T.; Makedon, F.; Plotkin, S.; Stein, C.; Tardos, E.; Tragoudas, S. |
| Feb-1991 | Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts | Tardos, E.; Klein, P.; Plotkin, S.; Stein, C. |
| Sep-1990 | A faster parametric minimum cut algorithm | Gusfield, D.; Tardos, E. |
| Oct-1989 | Improved Approximation Algorithm for oncurrent Multi-Commodity Flows | Tardos, E. |
| Feb-1995 | Improved approximation algorithms for network design problems | Goemans, M. X.; Goldberg, A. V.; Plotkin, S.; Shmoys, D. B.; Tardos, E.; Williamson, D. P. |
| Jan-1993 | Improved Bounds on the Max-flow Min-cut Ratio for Multicommodity Flows | Plotkin, S. A.; Tardos, E. |
| Sep-1989 | Network Flow Algorithm | Goldberg, A. V.; Tardos, E.; Tarjan, R. |
| Feb-1992 | Polynomial dual network simplex algorithms | Tardos, E.; Orlin, J. B.; Plotkin, S. |
| Feb-1995 | Polynomial Time Algorithms for Some Evacuation Problems | Hoppe, B.; Tardos, E. |
| Feb-1995 | The Quickest Transshipment Problem | Hoppe, B.; Tardos, E. |
| Mar-1992 | Scheduling unrelated parallel machines with costs | Tardos, E.; Shmoys, D. |
| Jan-1996 | Separating Maximally Violated Comb Inequalities in Planar Graphs | Fleischer, L.; Tardos, E. |
| Oct-1989 | Using Separation Algorithms in Fixed Dimension | Tardos, E.; Norton, C. H.; Plotkin, S. A. |
Showing results 1 to 20 of 20
|
