- 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 ScholarCross Ref
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- Yair Bartal, Rica Gonen, and Noam Nisan. Incentive compatible multi unit combinatorial auctions. In TARK, pages 72--87, 2003. Google ScholarDigital Library
- 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 ScholarDigital Library
- Niv Buchbinder and Rica Gonen. Incentive compatible multi-unit combinatorial auctions: a primal dual approach. Algorithmica (to appear).Google Scholar
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- Niv Buchbinder and Joseph Naor. Online primal-dual algorithms for covering and packing. Mathematics of Operations Research, 34(2):270--286, 2009. Google ScholarDigital Library
- 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 Scholar
- George B. Dantzig. Linear programming and extensions. Princeton University Press, 1998.Google Scholar
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 Scholar
- 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 ScholarCross Ref
- 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 Scholar
- Harold W. Kuhn and Albert W. Tucker. Nonlinear programming. In Proceedings of 2nd Berkeley Symposium, 1951.Google Scholar
- Aranyak Mehta, Amin Saberi, Umesh Vazirani, and Vijay Vazirani. Adwords and generalized online matching. Journal of the ACM, 54(5):22, 2007. Google ScholarDigital Library
- Kim Thang Nguyen. Lagrangian duality in online scheduling with resource augmentation and speed scaling. In Algorithms-ESA, pages 755--766. Springer, 2013.Google Scholar
Index Terms
SIGACT News Online Algorithms Column 25: Online Primal Dual: Beyond Linear Programs
Recommendations
SIGACT News Online Algorithms Column 35: 2019 in review
In this column, we will discuss some papers in online algorithms that appeared in 2019. As usual, we make no claim at complete coverage here, and have instead made a selection. If we have unaccountably missed your favorite paper and you would like to ...
SIGACT News Online Algorithms Column 30: 2016 in review
In this column, I will discuss some recent papers in online algorithms that appeared in 2016. Quite a number of papers on online algorithms appeared during the year, and I have had to make a selection; I am sure to have overlooked some papers. If I have ...
SIGACT news online algorithms column 8
Pros and cons of the competitive analysis have been discussed in the literature by many authors. Continuing this discussion in this quarter s column, Reza Dorrigiv and Alejandro Lopez-Ortiz review and compare various performance measures for online ...
Comments