Fast and simple approximation schemes for generalized flow

Mathematical Programming, Series B

Volumn 91, Issue 2, 2002, Pages 215-238

  Fleischer, Lisa K ^a   Wayne, Kevin D ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY BOUNDS; FRACTIONAL PACKING; MULTICOMMODITY FLOW; SHORTEST PATH PROBLEMS;

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING;

FLOW MEASUREMENT;

EID: 0005385492     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070100238     Document Type: Article

References (45)

1. Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 1995
2. Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
3. Ahuja, R.K., Magnanti, T.L., Orlin, J.B. (1993): Network Flows: Theory', Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ
4. Aspvall, B., Shiloach, Y. (1980): A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality. SIAM J. Comput. 9, 827-845
5. Bellman, R.E. (1958): On a routing problem. Quart. Appl. Math. 16, 87-90
6. Bienstock, D. (2001): Potential function algorithms for approximately solving linear programs: theory and practice. CORE Lecture Series monograph. Center for Operations Research & Econometric. Université catholique de Louvain, Louvain-la-Neuve, Belgium
7. Charnes, A., Raike, W.M. (1966): One-pass algorithms for some generalized network flow problems. Oper. Res. 14, 914-924
8. Cohen, E., Megiddo, N. (1994): Improved algorithms for linear inequalities with two variables per inequality. SIAM J. Comput. 23, 1313-1347
9. Cohen, E., Megiddo, N. (1994): New algorithms for generalized network flows. Math. Program. 64, 325-336
10. Dantzig, G.B. (1962): Linear programming and extensions. Princeton University Press, Princeton, NJ
11. Dijkstra, E.W. (1959): A note on two problems in connexion with graphs. Numer. Math. 1, 269-271
12. Fleischer, L.K. (2000): Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Discrete Math. 13(4), 505-520
13. Ford, L.R., Fulkerson, D.R. (1962): Flows in Networks. Princeton University Press, Princeton, NJ
14. Fredman, M.L., Tarjan, R.E. (1987): Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596-615
15. Garg, N., Könemann, J. (1998): Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: 39th Annual IEEE Symposium on Foundations of Computer Science, pp. 300-309
16. Glover, F., Klingman, D., Phillips, N. (1990): Netform modeling and applications. Interfaces 20, 7-27
17. Goldberg, A.V. (1992): A natural randomization strategy for multicommodity flow and related algorithms. Information Processing Letters 42, 249-256
18. Goldberg, A.V., Plotkin, S.A., Tardos, E. (1991): Combinatorial algorithms for the generalized circulation problem. Math. Oper. Res. 16, 351-379
19. Goldfarb, D., Jin, Z. (1996): A faster combinatorial algorithm for the generalized circulation problem. Math. Oper. Res. 21, 529-539
20. Goldfarb, D., Jin, Z., Orlin, J.B. (1997): Polynomial-time highest gain augmenting path algorithms for the generalized circulation problem. Math. Oper. Res. 22, 793-802
21. Grigoriadis, M.D., Khachiyan, L.G. (1994): Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM J. Optim. 4, 86-107
22. Grigoriadis, M.D., Khachiyan, L.G. (1996): Coordination complexity of parallel price-directive decomposition. Math. Oper. Res. 21, 321-340
23. Hassin, R. (1992): Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17, 36-42
24. Hochbaum, D.S., Naor, J. (1994): Simple and fast algorithms for linear and integer programs with two variables per inequality. SIAM J. Comput. 23-6, 1179-1192
25. Kamath, A., Palmon, O. (1995): Improved interior point algorithms for exact and approximate solution of multicommodity flow problems. In: ACM/SIAM [1], pp. 502-511
26. Kantorovich, L.V. (1960): Mathematical methods in the organization and planning of production. Publication House of the Leningrad State University, p. 68, 1939.
27. Translated in: Manage. Sci. 6, 366-422
28. Klein, P., Plotkin, S., Stein, C., Tardos, É. (1994): Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM J. Comput. 23, 466-487
29. Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, É., Tragoudas, S. (1995): Fast approximation algorithms for multicommodily flow problems. J. Comput. System Sci. 50, 228-243
30. Megiddo, N. (1983): Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30, 852-865
31. Moore, E.F. (1959): The shortest path through a maze. In: International Symposium on the Theory of Switching, pp. 285-292
32. Oldham, J.D. (1999): Combinatorial approximation algorithms for generalized flow problems. In: ACM/SIAM [2]
33. Plotkin, S.A., Shmoys, D., Tardos, É. (1995): Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 20, 257-301
34. Radzik, T. (1993): Approximate generalized circulation. Technical Report 93-2, Cornell Computational Optimization Project, Cornell University
35. Radzik, T. (1997): Fast deterministic approximation for the multicommodity flow problem. Math. Program. 78, 43-58
36. Radzik, T. (1998): Faster algorithms for the generalized network flow problem. Math. Oper. Res. 23, 69-100
37. Shahrokhi, F., Matula, D.W. (1990): The maximum concurrent flow problem. J. ACM 37, 318-334
38. Shostak, R. (1981): Deciding linear inequalities by computing loop residues. J. ACM 28, 769-779
39. Tardos, É., Wayne, K.D. (1998): Simple generalized maximum flow algorithms. In: 6th International Integer Programming and Combinatorial Optimization Conference, pp. 310-324
40. Truemper, K. (1977): On max flows with gains and pure min-cost flows. SIAM J. Appl. Math. 32, 450-456
41. Vaidya, P.M. (1989): Speeding up linear programming using fast matrix multiplication. In: 30th Annual IEEE Symposium on Foundations of Computer Science, pp. 332-337
42. Wayne, K.D. (1999): Generalized Maximum Flow Algorithms. PhD thesis, Department of Operations Research and Industrial Engineering, Cornell University
43. Wayne, K.D. (1999): A polynomial combinatorial algorithm for generalized minimum cost flow. In: Proceedings of the 31th Annual ACM Symposium on Theory of Computing
44. Wayne, K.D., Fleischer, L. (1999): Faster approximation algorithms for generalized flow. In: ACM/SIAM [2]
45. Young, N. (1995): Randomized rounding without solving the linear program. In: ACM/SIAM [1], pp. 170-178