Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method

Published:2017 Issue: Volume: Page:380-391
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Levy Avi,Ramadas Harishchandra,Rothvoss Thomas

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-59250-3_31

Reference23 articles.

1. Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theor. Comput. 8(6), 121–164 (2012)

2. Wiley-Interscience Series in Discrete Mathematics and Optimization;N Alon,2008

3. Banaszczyk, W.: Balancing vectors and Gaussian measures of $$n$$ -dimensional convex bodies. Random Struct. Algorithms 12(4), 351–360 (1998)

4. Bansal, N.: Constructive algorithms for discrepancy minimization. In: FOCS, pp. 3–10 (2010)

5. Bansal, N., Dadush, D., Garg, S: An algorithm for komlós conjecture matching banaszczyk’s bound. CoRR, abs/1605.02882 (2016)

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the concentration of Gaussian Cayley matrices;Applied and Computational Harmonic Analysis;2024-11

2. Optimal Online Discrepancy Minimization;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Algorithmic obstructions in the random number partitioning problem;The Annals of Applied Probability;2023-12-01

4. The Phase Transition of Discrepancy in Random Hypergraphs;SIAM Journal on Discrete Mathematics;2023-08-17

5. Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3