Author of the publication

On Complexity of 1-Center in Various Metrics.

, , , , and . APPROX/RANDOM, volume 275 of LIPIcs, page 1:1-1:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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.

 

Other publications of authors with the same name

Applications of Random Algebraic Constructions to Hardness of Approximation., , and . FOCS, page 237-244. IEEE, (2021)On Efficient Low Distortion Ultrametric Embedding., , and . ICML, volume 119 of Proceedings of Machine Learning Research, page 2078-2088. PMLR, (2020)Inapproximability of Clustering in Lp Metrics., and . FOCS, page 519-539. IEEE Computer Society, (2019)Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof., , , and . SOSA, page 383-395. SIAM, (2024)Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291)., , , , and . Dagstuhl Reports, 13 (7): 96-107 (2023)On Complexity of 1-Center in Various Metrics., , , , and . APPROX/RANDOM, volume 275 of LIPIcs, page 1:1-1:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Fairness of linear regression in decision making., , , , and . Int. J. Data Sci. Anal., 18 (3): 337-347 (September 2024)Can You Solve Closest String Faster Than Exhaustive Search?, , , , and . ESA, volume 274 of LIPIcs, page 3:1-3:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP., , and . CoRR, (2024)Hardness Amplification of Optimization Problems., and . CoRR, (2019)