( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximating rooted Steiner networks.

, , , и . SODA, стр. 1499-1511. SIAM, (2012)

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.

Bundit Pibaljommee

Bundit Anurugsa

 

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

On Survivable Set Connectivity., , и . SODA, стр. 25-36. SIAM, (2015)Polynomial Integrality Gap of Flow LP for Directed Steiner Tree., и . SODA, стр. 3230-3236. SIAM, (2022)On the Complexity of Closest Pair via Polar-Pair of Point-Sets., , и . SoCG, том 99 из LIPIcs, стр. 28:1-28:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More., , , , , , и . FOCS, стр. 743-754. IEEE Computer Society, (2017)Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs., , и . FOCS, стр. 444-453. IEEE Computer Society, (2014)O(log2 k / log log k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm., , и . STOC, стр. 253-264. ACM, (2019)The Curse of Medium Dimension for Geometric Problems in Almost Every Norm., , и . CoRR, (2016)Routing Regardless of Network Stability., , и . ESA, том 7501 из Lecture Notes in Computer Science, стр. 719-730. Springer, (2012)Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs., , , и . SODA, стр. 737-751. SIAM, (2017)Survivable Network Design Revisited: Group-Connectivity., , , и . FOCS, стр. 278-289. IEEE, (2022)