( en | de | ru )

 

Disambiguation of "Uniyal, Sumedha"

Author of the publication

copydeleteadd this publication to your clipboard
PTAS for Steiner Tree on Map Graphs.

, , , , and . LATIN, volume 12118 of Lecture Notes in Computer Science, page 3-14. Springer, (2020)

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.

Sumedha Chouthe

 

Other publications of authors with the same name

An Approximation Algorithm for Uniform Capacitated k-Median Problem with 1+Capacity Violation., , and . IPCO, volume 9682 of Lecture Notes in Computer Science, page 262-274. Springer, (2016)A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs., , and . STACS, volume 126 of LIPIcs, page 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)PTAS for Steiner Tree on Map Graphs., , , , and . CoRR, (2019)A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs., , and . CoRR, (2018)Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows., , and . WAOA, volume 9499 of Lecture Notes in Computer Science, page 13-24. Springer, (2015)Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter., , , , , and . CoRR, (2021)Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter., , , , , and . ACM Trans. Algorithms, 20 (1): 6:1-6:20 (January 2024)A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints., , , and . ICALP, volume 132 of LIPIcs, page 85:1-85:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)An approximation algorithm for Uniform Capacitated k-Median problem with 1 + ε capacity violation., , and . CoRR, (2015)Multi-transversals for Triangles and the Tuza's Conjecture., , , and . SODA, page 1955-1974. SIAM, (2020)