From post

Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints.

, , , и . ICALP (1), том 7391 из Lecture Notes in Computer Science, стр. 145-156. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Online Primal-Dual Algorithms for Covering and Packing., и . Math. Oper. Res., 34 (2): 270-286 (2009)Online Submodular Maximization: Beating 1/2 Made Simple., , , и . IPCO, том 11480 из Lecture Notes in Computer Science, стр. 101-114. Springer, (2019)Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual., , и . CoRR, (2020)Lower and Upper Bounds on Obtaining History Independence., и . CRYPTO, том 2729 из Lecture Notes in Computer Science, стр. 445-462. Springer, (2003)Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case., , , , и . INFOCOM, стр. 2402-2410. IEEE, (2010)Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue., , и . ESA, том 4698 из Lecture Notes in Computer Science, стр. 253-264. Springer, (2007)Deterministic Algorithms for Submodular Maximization Problems., и . SODA, стр. 392-403. SIAM, (2016)Online Submodular Maximization with Preemption., , и . SODA, стр. 1202-1216. SIAM, (2015)Metrical Task Systems and the k-Server Problem on HSTs., , и . ICALP (1), том 6198 из Lecture Notes in Computer Science, стр. 287-298. Springer, (2010)Non-cooperative Cost Sharing Games Via Subsidies., , , и . SAGT, том 4997 из Lecture Notes in Computer Science, стр. 337-349. Springer, (2008)