skip to main content
column

SIGACT News Online Algorithms Column 25: Online Primal Dual: Beyond Linear Programs

Published:09 December 2014Publication History
First page image

References

  1. Shipra Agrawal and Nikhil R. Devanur. Fast algorithms for online stochastic convex programming. In Proceedings of the 26th Annual Symposium on Discrete Algorithms. SIAM, 2015.Google ScholarGoogle ScholarCross RefCross Ref
  2. S. Anand, Naveen Garg, and Amit Kumar. Resource augmentation for weighted flow-time explained by dual fitting. In Proceedings of the 23rd Annual Symposium on Discrete Algorithms, pages 1228--1241. SIAM, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Nikhil Bansal, Niv Buchbinder, and Joseph Seffi Naor. Randomized competitive algorithms for generalized caching. In Proceedings of the 40th Symposium on Theory of Computing, pages 235--244. ACM, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Nikhil Bansal, Ho-Leung Chan, and Kirk Pruhs. Speed scaling with an arbitrary power function. In Proceedings of the 20th Annual symposium on discrete algorithms, pages 693--701. SIAM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Nikhil Bansal, Niv Buchbinder, and Joseph Seffi Naor. A primal-dual randomized algorithm for weighted paging. Journal of the ACM, 59(4):19, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Yair Bartal, Rica Gonen, and Noam Nisan. Incentive compatible multi unit combinatorial auctions. In TARK, pages 72--87, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Avrim Blum, Anupam Gupta, Yishay Mansour, and Ankit Sharma. Welfare and profit maximization with production costs. In Proceedings of the 52nd Annual Symposium on Foundations of Computer Science, pages 77--86. IEEE, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Niv Buchbinder and Rica Gonen. Incentive compatible multi-unit combinatorial auctions: a primal dual approach. Algorithmica (to appear).Google ScholarGoogle Scholar
  9. Niv Buchbinder and Joseph Naor. The design of competitive online algorithms via a primal: dual approach. Foundations and Trends in Theoretical Computer Science, 3(2{3):93--263, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Niv Buchbinder and Joseph Naor. The design of competitive online algorithms via a primal: dual approach. Foundations and Trends in Theoretical Computer Science, 3(2{3):93--263, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Niv Buchbinder and Joseph Naor. Online primal-dual algorithms for covering and packing. Mathematics of Operations Research, 34(2):270--286, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Niv Buchbinder, Kamal Jain, and Joseph Seffi Naor. Online primal-dual algorithms for maximizing ad-auctions revenue. In Algorithms-ESA, pages 253--264. Springer, 2007. Google ScholarGoogle Scholar
  13. George B. Dantzig. Linear programming and extensions. Princeton University Press, 1998.Google ScholarGoogle Scholar
  14. Nikhil R. Devanur and Zhiyi Huang. Primal dual gives almost optimal energy efficient online algorithms. In Proceedings of the 25th Annual Symposium on Discrete Algorithms, pages 1123--1140. SIAM, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Nikhil R. Devanur and Kamal Jain. Online matching with concave returns. In Proceedings of the 44th Annual Symposium on Theory of Computing, pages 137--144. ACM, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Nikhil R. Devanur, Kamal Jain, and Robert D. Kleinberg. Randomized primal-dual analysis of ranking for online bipartite matching. In Proceedings of the 24th Annual Symposium on Discrete Algorithms, pages 101--107. SIAM, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Anupam Gupta, Ravishankar Krishnaswamy, and Kirk Pruhs. Online primal-dual for non-linear optimization with applications to speed scaling. In Approximation and Online Algorithms, pages 173--186. Springer, 2013.Google ScholarGoogle Scholar
  18. Zhiyi Huang and Anthony Kim. Welfare maximization with production costs: a primal dual approach. In Proceedings of the 26th Annual Symposium on Discrete Algorithms. SIAM, 2015.Google ScholarGoogle ScholarCross RefCross Ref
  19. William Karush. Minima of functions of several variables with inequalities as side constraints. PhD thesis, Master's Thesis, Dept. of Mathematics, Univ. of Chicago, 1939.Google ScholarGoogle Scholar
  20. Harold W. Kuhn and Albert W. Tucker. Nonlinear programming. In Proceedings of 2nd Berkeley Symposium, 1951.Google ScholarGoogle Scholar
  21. Aranyak Mehta, Amin Saberi, Umesh Vazirani, and Vijay Vazirani. Adwords and generalized online matching. Journal of the ACM, 54(5):22, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Kim Thang Nguyen. Lagrangian duality in online scheduling with resource augmentation and speed scaling. In Algorithms-ESA, pages 755--766. Springer, 2013.Google ScholarGoogle Scholar

Index Terms

  1. SIGACT News Online Algorithms Column 25: Online Primal Dual: Beyond Linear Programs
        Index terms have been assigned to the content through auto-classification.

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM SIGACT News
          ACM SIGACT News  Volume 45, Issue 4
          December 2014
          108 pages
          ISSN:0163-5700
          DOI:10.1145/2696081
          Issue’s Table of Contents

          Copyright © 2014 Author

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 9 December 2014

          Check for updates

          Qualifiers

          • column

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader