From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces

F. Abbasi, S. Banerjee, J. Byrka, P. Chalermsook, A. Gadekar, K. Khodamoradi, D. Marx, R. Sharma, и J. Spoerhase. Proc. 51st International Colloquium on Automata, Languages and Programming (ICALP'24), (2024)

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.

Parinya Wilaiphan

Parinya Sirimachan

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

Coloring and Maximum Weight Independent Set of Rectangles.P. Chalermsook, и B. Walczak. CoRR, (2020)Parameterized Approximation Schemes for Clustering with General Norm Objectives.F. Abbasi, S. Banerjee, J. Byrka, P. Chalermsook, A. Gadekar, K. Khodamoradi, D. Marx, R. Sharma, и J. Spoerhase. FOCS, стр. 1377-1399. IEEE, (2023)On Survivable Set Connectivity.P. Chalermsook, F. Grandoni, и B. Laekhanukit. SODA, стр. 25-36. SIAM, (2015)On Minimum Generalized Manhattan Connections.A. Antoniadis, M. Capretto, P. Chalermsook, C. Damerius, P. Kling, L. Nölke, N. Acosta, и J. Spoerhase. WADS, том 12808 из Lecture Notes in Computer Science, стр. 85-100. Springer, (2021)New Approximability Results for the Robust k-Median Problem.S. Bhattacharya, P. Chalermsook, K. Mehlhorn, и A. Neumann. SWAT, том 8503 из Lecture Notes in Computer Science, стр. 50-61. Springer, (2014)From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More.P. Chalermsook, M. Cygan, G. Kortsarz, B. Laekhanukit, P. Manurangsi, D. Nanongkai, и L. Trevisan. FOCS, стр. 743-754. IEEE Computer Society, (2017)Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs.P. Chalermsook, B. Laekhanukit, и D. Nanongkai. FOCS, стр. 444-453. IEEE Computer Society, (2014)A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs.P. Chalermsook, A. Schmid, и S. Uniyal. STACS, том 126 из LIPIcs, стр. 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set.P. Chalermsook, и D. Vaz. Electron. Notes Discret. Math., (2016)Mimicking Networks Parameterized by Connectivity.P. Chalermsook, S. Das, B. Laekhanukit, и D. Vaz. CoRR, (2019)

BibSonomy

Disambiguation