( en | de | ru )

 

Disambiguation of "Laekhanukit, Bundit"

Author of the publication

copydeleteadd this publication to your clipboard
Survivable Network Design Revisited: Group-Connectivity.

, , , and . FOCS, page 278-289. IEEE, (2022)

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.

Bundit Pibaljommee

Bundit Anurugsa

 

Other publications of authors with the same name

The Curse of Medium Dimension for Geometric Problems in Almost Every Norm., , and . CoRR, (2016)Routing Regardless of Network Stability., , and . ESA, volume 7501 of Lecture Notes in Computer Science, page 719-730. Springer, (2012)Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs., , , and . SODA, page 737-751. SIAM, (2017)Survivable Network Design Revisited: Group-Connectivity., , , and . FOCS, page 278-289. IEEE, (2022)Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity., , , and . ICALP, volume 229 of LIPIcs, page 89:1-89:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On the Approximability of the Traveling Salesman Problem with Line Neighborhoods., , , and . SWAT, volume 227 of LIPIcs, page 10:1-10:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems. CoRR, (2012)New Tools and Connections for Exponential-time Approximation., , , , and . CoRR, (2017)Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing., , , , and . WINE, volume 6484 of Lecture Notes in Computer Science, page 444-454. Springer, (2010)An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity - (Extended Abstract).. ICALP (1), volume 6755 of Lecture Notes in Computer Science, page 13-24. Springer, (2011)