( en | de | ru )

 

Disambiguation of "Chekuri, Chandra"

Author of the publication

copydeleteadd this publication to your clipboard
On Multiplicative Weight Updates for Concave and Submodular Function Maximization.

, , and . ITCS, page 201-210. ACM, (2015)

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

Arvind Chandra

Laltu Chandra

 

Other publications of authors with the same name

Polynomial Bounds for the Grid-Minor Theorem, and . CoRR, (2013)The all-or-nothing multicommodity flow problem., , and . STOC, page 156-165. ACM, (2004)On Multiplicative Weight Updates for Concave and Submodular Function Maximization., , and . ITCS, page 201-210. ACM, (2015)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)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)Approximation algorithms for the metric labeling problem via a new linear programming formulation., , , and . SODA, page 109-118. ACM/SIAM, (2001)A deterministic algorithm for the cost-distance problem., , and . SODA, page 232-233. ACM/SIAM, (2001)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)