On a generalization of iterated and randomized rounding-Reference-Cited by-同舟云学术

On a generalization of iterated and randomized rounding

Published:2019-06-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Bansal Nikhil¹

Affiliation:

1. CWI, Netherlands / Eindhoven University of Technology, Netherlands

Funder

European Research Council

Nederlandse Organisatie voor Wetenschappelijk Onderzoek

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3313276.3316313

Reference51 articles.

1. Nima Anari and Shayan Oveis Gharan. 2015. Nima Anari and Shayan Oveis Gharan. 2015.

2. Effective-Resistance-Reducing Flows Spectrally Thin Trees and Asymmetric TSP. In Foundations of Computer Science FOCS. 20–39. Effective-Resistance-Reducing Flows Spectrally Thin Trees and Asymmetric TSP. In Foundations of Computer Science FOCS. 20–39.

3. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

4. Arash Asadpour and Amin Saberi. 2010. Arash Asadpour and Amin Saberi. 2010.

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

1. On the Multilayer Planning of Filterless Optical Networks With OTN Encryption;IEEE/ACM Transactions on Networking;2023-12

2. Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

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

4. Approximating weighted completion time via stronger negative correlation;Journal of Scheduling;2023-03-30

5. Solving SDP Faster: A Robust IPM Framework and Efficient Implementation;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10