( en | de | ru )

 

Disambiguation of "Chekuri, Chandra"

Author of the publication

copydeleteadd this publication to your clipboard
Parallelizing greedy for submodular set function maximization in matroids and beyond.

, and . STOC, page 78-89. ACM, (2019)

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. You can also use the button next to the name to display some publications already assigned to the person.

Umananda Chandra

Harish Chandra

Sunil Chandra

Laltu Chandra

Arvind Chandra

 

Other publications of authors with the same name

Scheduling Problems in Parallel Query Optimization., , and . PODS, page 255-265. ACM Press, (1995)Polynomial Bounds for the Grid-Minor Theorem, and . CoRR, (2013)On Multiplicative Weight Updates for Concave and Submodular Function Maximization., , and . ITCS, page 201-210. ACM, (2015)The all-or-nothing multicommodity flow problem., , and . STOC, page 156-165. ACM, (2004)A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines., and . ICALP, volume 2076 of Lecture Notes in Computer Science, page 848-861. Springer, (2001)Conjunctive Query Containment Revisited., and . ICDT, volume 1186 of Lecture Notes in Computer Science, page 56-70. Springer, (1997)Longest Wait First for Broadcast Scheduling Extended Abstract., , and . WAOA, volume 5893 of Lecture Notes in Computer Science, page 62-74. Springer, (2009)Faster and Scalable Algorithms for Densest Subgraph and Decomposition., , and . NeurIPS, (2022)Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs., , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 42-55. Springer, (2009)Independent Sets in Elimination Graphs with a Submodular Objective., and . APPROX/RANDOM, volume 275 of LIPIcs, page 24:1-24:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)