( en | de | ru )

 

Disambiguation of "Chekuri, Chandra"

Author of the publication

copydeleteadd this publication to your clipboard
Fast Approximations for Metric-TSP via Linear Programming.

, and . CoRR, (2018)

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.

Harish Chandra

Umananda Chandra

Sunil Chandra

Arvind Chandra

Laltu Chandra

 

Other publications of authors with the same name

Set connectivity problems in undirected graphs and the directed Steiner network problem., , , and . SODA, page 532-541. SIAM, (2008)A note on approximate strengths of edges in a hypergraph., and . CoRR, (2017)Fast Approximations for Metric-TSP via Linear Programming., and . CoRR, (2018)Approximating Steiner k-Cuts., , and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 189-199. Springer, (2003)Multicommodity Demand Flow in a Tree., , and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 410-425. Springer, (2003)Algorithms for 2-Route Cut Problems., and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 472-484. Springer, (2008)Polynomial bounds for the grid-minor theorem., and . STOC, page 60-69. ACM, (2014)The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs., and . IPCO, volume 8494 of Lecture Notes in Computer Science, page 222-233. Springer, (2014)Centrality of Trees for Capacitated k-Center., , , , , and . IPCO, volume 8494 of Lecture Notes in Computer Science, page 52-63. Springer, (2014)On Multi-Dimensional Packing Problems., and . SODA, page 185-194. ACM/SIAM, (1999)