Streaming algorithms for submodular function maximization C Chekuri, S Gupta, K Quanrud
Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015
129 2015 Approximation algorithms for polynomial-expansion and low-density graphs S Har-Peled, K Quanrud
SIAM Journal on Computing 46 (6), 1712-1744, 2017
112 2017 Online learning with adversarial delays K Quanrud, D Khashabi
Advances in neural information processing systems 28, 2015
110 2015 Submodular function maximization in parallel via the multilinear relaxation C Chekuri, K Quanrud
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
70 2019 Approximating optimal transport with linear programs K Quanrud
arXiv preprint arXiv:1810.05957, 2018
57 2018 Densest subgraph: Supermodularity, iterative peeling, and flow C Chekuri, K Quanrud, MR Torres
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
53 2022 Parallelizing greedy for submodular set function maximization in matroids and beyond C Chekuri, K Quanrud
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
51 2019 Approximating the held-karp bound for metric TSP in nearly-linear time C Chekuri, K Quanrud
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
38 2017 LP Relaxation and Tree Packing for Minimum C Chekuri, K Quanrud, C Xu
SIAM Journal on Discrete Mathematics 34 (2), 1334-1353, 2020
35 2020 Near-linear time approximation schemes for some implicit fractional packing problems C Chekuri, K Quanrud
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
26 2017 Randomized MWU for positive LPs C Chekuri, K Quanrud
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
25 2018 On approximating (sparse) covering integer programs C Chekuri, K Quanrud
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
24 2019 Faster and scalable algorithms for densest subgraph and decomposition E Harb, K Quanrud, C Chekuri
Advances in Neural Information Processing Systems 35, 26966-26979, 2022
21 2022 Isolating cuts,(bi-) submodularity, and faster algorithms for connectivity C Chekuri, K Quanrud
48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021
18 2021 Fast LP-based approximations for geometric packing and covering problems C Chekuri, S Har-Peled, K Quanrud
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
18 2020 Fast approximations for metric-tsp via linear programming C Chekuri, K Quanrud
arXiv preprint arXiv:1802.01242, 2018
18 2018 Fast and Deterministic Approximations for K Quanrud
arXiv preprint arXiv:1807.07143, 2018
14 2018 A fast approximation for maximum weight matroid intersection C Chekuri, K Quanrud
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
13 2016 On approximating partial set cover and generalizations C Chekuri, K Quanrud, Z Zhang
arXiv preprint arXiv:1907.04413, 2019
12 2019 Quotient sparsification for submodular functions K Quanrud
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
10 2024 
Chandra ChekuriProfessor of Computer Science, University of Illinois, Urbana-ChampaignZweryfikowany adres z illinois.edu
