Simultaneous optimization via approximate majorization for concave profits or convex costs

Algorithmica (New York)

Volumn 44, Issue 4, 2006, Pages 301-323

  Goel, Ashish ^a   Meyerson, Adam ^b  

^a STANFORD UNIVERSITY   (United States)

^b University of California   (United States)

Author keywords

Fairness; Simultaneous optimization

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING;

FAIRNESS; SIMULTANEOUS OPTIMIZATION;

FUNCTIONS;

EID: 32944478052     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-005-1177-7     Document Type: Article

References (34)

1. Y. Afek, Y. Mansour, and Z. Ostfeld. Convergence complexity of optimistic rate based flow control algorithms. Journal of Algorithms, 30(1): 106-143, 1999.
2. N. Alon, Y. Azar, G. Woeginger, and T. Yadid. Approximation schemes for scheduling. Proceedings of the Eighth ACM-SIAM Symposium on Discrete Algorithms, pages 493-500, 1997.
3. Y. Azar, L. Epstein, Y. Richter, and G. Woeginger. All-norm approximation algorithms. Journal of Algorithms, 52(2):120-133, 2004.
4. D. Bertsekas and R. Gallager. Data Networks. Prentice-Hall, Englewood Cliffs, NJ, 1992.
5. C. Chekuri, S. Khanna, and S. Naor. A deterministic algorithm for the cost-distance problem. Proceedings of the 12th Annual Symposium on Discrete Algorithms, pages 232-233, 2001.
6. D. Chiu and R. Jain. Analysis of the increase/decrease algorithms for congestion avoidance in computer networks. Journal of Computer Networks and ISDN, 17(1): 1-14, June 1989.
7. S. Floyd. Connections with multiple congested gateways in packet-switched networks, part 1: one-way traffic. Computer Communications Review, 21(5):30-47, October 1991.
8. N. Garg and J. Konemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pages 300-309, 1998.
9. A. Goel and P. Indyk. Stochastic load balancing with exponential jobs. Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pages 769-778, October 1999.
10. A. Goel, A. Meyerson, and S. Plotkin. Approximate majorization and fair online load balancing. Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, pages 384-390, 2001.
11. A. Goel, A. Meyerson, and S. Plotkin. Combining fairness with throughput: online routing with multiple objectives. Journal of Computer and Systems Sciences, 63(1):62-79, 2001.
12. M. Grotschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin, 1987.
13. G.H. Hardy, J.E. Littlewood, and G. Polya. Some simple inequalities satisfied by convex functions. Messenger Mathematics, 58:145-152, 1929.
14. D. Hochbaum. Approximation Algorithms for NP-Hard Problems. PWS, Boston, MA, 1997.
15. D. Hochbaum and D. Shmoys. Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the ACM, 34(1):144-162, 1987.
16. K. Jain and V. Vazirani. Primal-dual approximation algorithms for metric facility location and k-median problems. Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pages 2-13, 1999.
17. R. Jain, D. Chiu, and W. Hawe. A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. DEC Research Report TR-301, September 1984.
18. J. Kleinberg, Y. Rabani, and E. Tardos. Allocating bandwidth for bursty connections. SIAM Journal on Computing, 30(1):191-217, 2000.
19. J. Kleinberg, Y. Rabani, and E. Tardos. Fairness in routing and load balancing. Journal of Computer and System Sciences, 63(1):2-20, 2001.
20. C.E. Koksal, H.I. Kassab, and H. Balakrishnan. An analysis of short-term fairness in wireless media access protocols. Proceedings of ACM SIGMETRICS, pages 118-119, June 2000.
21. A. Kumar and J. Kleinberg. Fairness measures for resource allocation. Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pages 75-85, 2000.
22. T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. Journal of Computer and System Sciences, 50:228-243, 1995.
23. J. Lenstra, D. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46(3):259-271, 1990.
24. M.V. Marathe, R. Ravi, R. Sundaram, S.S. Ravi, D.J. Rosenkrantz, and H.B. Hunt III. Bicriteria network design problems. Proceeding of the 22nd International Colloquium on Automata, Languages and Programming (ICALP), Szeged, Hungary, pages 142-171. LNCS 944. Springer-Verlag, Berlin, July 1995.
25. A.W. Marshall and I. Olkin. Inequalities: Theory of Majorization and Its Applications. Volume 143 of Mathematics in Science and Engineering. Academic Press, New York, 1979.
26. N. Megiddo. Optimal flows in networks with sources and sinks. Mathematical Programming, 7(3):97-107, 1974.
27. N. Megiddo. A good algorithm for lexicographically optimal flow in multiterminal networks. Bulletin of the American Mathematical Society, 83(3):407-409, 1977.
28. A. Meyerson, K. Munagala, and S. Plotkin. Cost-distance: two metric network design. Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pages 624-630, 2000.
29. M. Pinedo. Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, Englewood Cliffs, NJ, 1995.
30. S. Plotkin, D. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20:257-301, 1995.
31. F. Shahrokhi and D.W. Matula. The maximum concurrent flow problem. Journal of the ACM, 37(2):318-334, 1990.
32. D. Shmoys and E. Tardos. An approximation algorithm for the generalized assignement problem. Mathematical Programming, 62:461-474, 1993.
33. A. Tamir. Least majorized elements and generalized polymatroids. Mathematics of Operations Research, 20(3):583-589, 1995.
34. A. Veinott. Least d-majorized network flows with inventory and statistical applications. Management Science, 17(9):547-567, 1971.