( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximation algorithms for the metric labeling problem via a new linear programming formulation.

, , , и . SODA, стр. 109-118. ACM/SIAM, (2001)

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.

Umananda Chandra

Harish Chandra

Sunil Chandra

Arvind Chandra

Laltu Chandra

 

Другие публикации лиц с тем же именем

Submodular Function Maximization in Parallel via the Multilinear Relaxation., и . SODA, стр. 303-322. SIAM, (2019)Single-Sink Network Design with Vertex Connectivity Requirements., и . FSTTCS, том 2 из LIPIcs, стр. 131-142. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2008)Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs., , и . ICALP, том 55 из LIPIcs, стр. 7:1-7:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Scheduling Problems in Parallel Query Optimization., , и . PODS, стр. 255-265. ACM Press, (1995)Polynomial Bounds for the Grid-Minor Theorem, и . CoRR, (2013)On Multiplicative Weight Updates for Concave and Submodular Function Maximization., , и . ITCS, стр. 201-210. ACM, (2015)The all-or-nothing multicommodity flow problem., , и . STOC, стр. 156-165. ACM, (2004)Conjunctive Query Containment Revisited., и . ICDT, том 1186 из Lecture Notes in Computer Science, стр. 56-70. Springer, (1997)Parallelizing greedy for submodular set function maximization in matroids and beyond., и . STOC, стр. 78-89. ACM, (2019)A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines., и . ICALP, том 2076 из Lecture Notes in Computer Science, стр. 848-861. Springer, (2001)