Chandra Sekhar Chekuri

19952019
If you made any changes in Pure, your changes will be visible here soon.

Fingerprint Fingerprint is based on mining the text of the expert's scholarly documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

  • 4 Similar Profiles
Approximation algorithms Engineering & Materials Science
Approximation Mathematics
Approximation Algorithms Mathematics
Directed graphs Engineering & Materials Science
Polynomials Engineering & Materials Science
Network Design Mathematics
Scheduling Engineering & Materials Science
Graph in graph theory Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 1995 2019

1-sparsity Approximation Bounds for Packing Integer Programs

Chekuri, C. S., Quanrud, K. & Torres, M. R., Jan 1 2019, Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Proceedings. Lodi, A. & Nagarajan, V. (eds.). Springer-Verlag, p. 128-140 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11480 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Integer Program
Sparsity
Packing
Approximation
Approximation algorithms

On approximating (sparse) covering integer programs

Chekuri, C. S. & Quanrud, K., Jan 1 2019, p. 1596-1615. 20 p.

Research output: Contribution to conferencePaper

Integer Program
Covering
Approximation Algorithms
Approximation algorithms
Linear Time

Parallelizing greedy for submodular set function maximization in matroids and beyond

Chekuri, C. S. & Quanrud, K., Jun 23 2019, STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Charikar, M. & Cohen, E. (eds.). Association for Computing Machinery, p. 78-89 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Amplification

Submodular function maximization in parallel via the multilinear relaxation

Chekuri, C. S. & Quanrud, K., Jan 1 2019, p. 303-322. 20 p.

Research output: Contribution to conferencePaper

Submodular Function
Packing
Adaptivity
Cardinality Constraints
Parallel algorithms

A note on iterated rounding for the survivable network design problem

Chekuri, C. S. & Rukkanchanunt, T., Jan 1 2018, 1st Symposium on Simplicity in Algorithms, SOSA 2018 - Co-located with the 29th ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Seidel, R. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2. (OpenAccess Series in Informatics; vol. 61).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

network design
Rounding
Network Design
connectivity
Edge-connectivity