Deterministic Replacement Path Covering

von Karthik, C. S.
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 1 of 4 (2021)

On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes

von Karthik, C. S.
Veröffentlicht in SIAM Symposium on Simplicity in Algorithms (4. : 2021 : Online) Fourth Symposium on Simplicity in Algorithms (SOSA 2021) (2021)

Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in lp-metrics

von Cohen-Addad, Vincent
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (2022 : Online) ACM-SIAM Symposium on Discrete Algorithms (SODA22) ; Volume 2 of 5 (2022)

ON EFFICIENT LOW DISTORTION ULTRAMETRIC EMBEDDING

von Cohen-Addad, Vincent
Veröffentlicht in International Conference on Machine Learning (37. : 2020 : Online) 37th International Conference on Machine Learning (ICML 2020) ; Part 3 of 15 (2021)

On Approximability of Steiner Tree in £,-MIetrics

von Fleischmann, Henry
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (35. : 2024 : Alexandria, Va.) 2024 ACM-SIAM Symposium on Discrete Algorithms (SODA 2024) ; Volume 3 of 7 (2024)

Obtaining Approximately Optimal and Diverse Solutions via Dispersion

von Gao, Jie
Veröffentlicht in LATIN (15. : 2022 : Guanajuato) LATIN 2022 - theoretical informatics (2022)

Cosmic Muon Veto for the Mini-ICAL Detector at IICHEP, Madurai

von Satyanarayana, B.
Veröffentlicht in DAE-BRNS High Energy Physics Symposium (24. : 2020 : Online) Proceedings of the XXIV DAE-BRNS High Energy Physics Symposium, Jatni, India (2022)