( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable.

, , , , и . SODA, стр. 699-711. SIAM, (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.

Sayan Chakrabarty

Sayan Ghosh

Sayan Mitra

 

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

An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many Matching., и . SoCG, том 293 из LIPIcs, стр. 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Coresets for Clustering in Geometric Intersection Graphs., , и . SoCG, том 258 из LIPIcs, стр. 10:1-10:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Voronoi Game on Graphs., , , и . WALCOM, том 7748 из Lecture Notes in Computer Science, стр. 77-88. Springer, (2013)Socially Fair Matching: Exact and Approximation Algorithms., , , , и . WADS, том 14079 из Lecture Notes in Computer Science, стр. 79-92. Springer, (2023)Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering., , и . CoRR, (апреля 2025)Lossy Kernelization of Same-Size Clustering., , , , и . CSR, том 13296 из Lecture Notes in Computer Science, стр. 96-114. Springer, (2022)Near-Optimal Clustering in the k-machine model., , , и . ICDCN, стр. 15:1-15:10. ACM, (2018)A Polynomial-Time Approximation for Pairwise Fair k-Median Clustering., , , и . CoRR, (2024)Capacitated Covering Problems in Geometric Spaces., , , и . Discret. Comput. Geom., 63 (4): 768-798 (2020)Geometric Covering via Extraction Theorem., , , , и . ITCS, том 287 из LIPIcs, стр. 7:1-7:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)