( en | de | ru )

 

Disambiguation of "Laekhanukit, Bundit"

Author of the publication

copydeleteadd this publication to your clipboard
Stackelberg Pricing is Hard to Approximate within 2-ε

, , and . CoRR, (2009)

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

Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems. CoRR, (2012)Faster Algorithms for Semi-Matching Problems, , and . CoRR, (2010)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)Faster Algorithms for Semi-matching Problems (Extended Abstract)., , and . ICALP (1), volume 6198 of Lecture Notes in Computer Science, page 176-187. Springer, (2010)Simple Combinatorial Construction of the ko(1)-Lower Bound for Approximating the Parameterized k-Clique., , , and . CoRR, (2023)New Tools and Connections for Exponential-Time Approximation., , , , and . Algorithmica, 81 (10): 3993-4009 (2019)New Tools and Connections for Exponential-time Approximation., , , , and . CoRR, (2017)Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs., , , and . APPROX-RANDOM, volume 176 of LIPIcs, page 63:1-63:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses., , and . FOCS, page 370-379. IEEE Computer Society, (2013)