( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Online Primal-Dual Algorithms for Covering and Packing.

, и . Math. Oper. Res., 34 (2): 270-286 (2009)

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.

Niv Drory

Friedrich Buchbinder

Sascha Buchbinder

Maria Buchbinder

Hans Buchbinder

 

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

A general approach to online network optimization problems., , , , и . ACM Trans. Algorithms, 2 (4): 640-660 (2006)Secretary Problems via Linear Programming., , и . Math. Oper. Res., 39 (1): 190-206 (2014)Online Algorithms for Maximum Cardinality Matching with Edge Arrivals., , и . Algorithmica, 81 (5): 1781-1799 (2019)Unified Algorithms for Online Learning and Competitive Analysis., , , и . COLT, том 23 из JMLR Proceedings, стр. 5.1-5.18. JMLR.org, (2012)Incentives in Online Auctions via Linear Programming., , и . WINE, том 6484 из Lecture Notes in Computer Science, стр. 106-117. Springer, (2010)Non-cooperative Cost Sharing Games Via Subsidies., , , и . SAGT, том 4997 из Lecture Notes in Computer Science, стр. 337-349. Springer, (2008)A Regularization Approach to Metrical Task Systems., , , и . ALT, том 6331 из Lecture Notes in Computer Science, стр. 270-284. Springer, (2010)Competitive Algorithms for Restricted Caching and Matroid Caching., , и . ESA, том 8737 из Lecture Notes in Computer Science, стр. 209-221. Springer, (2014)Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach., , , , и . INFOCOM, стр. 145-153. IEEE, (2009)Constrained Submodular Maximization via New Bounds for DR-Submodular Functions., и . CoRR, (2023)