Local Computation Algorithms for Maximum Matching: New Lower Bounds
Behnezhad, Soheil, Roghani, Mohammad, Rubinstein, Aviad
Published in 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) (06.11.2023)
Published in 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) (06.11.2023)
Get full text
Conference Proceeding
Sublinear Metric Steiner Tree via Improved Bounds for Set Cover
Mahabadi, Sepideh, Roghani, Mohammad, Tarnawski, Jakub, Vakilian, Ali
Year of Publication 13.11.2024
Year of Publication 13.11.2024
Get full text
Journal Article
Sublinear Algorithms for TSP via Path Covers
Behnezhad, Soheil, Roghani, Mohammad, Rubinstein, Aviad, Saberi, Amin
Year of Publication 12.01.2023
Year of Publication 12.01.2023
Get full text
Journal Article
Beating Greedy Matching in Sublinear Time
Behnezhad, Soheil, Roghani, Mohammad, Rubinstein, Aviad, Saberi, Amin
Year of Publication 27.06.2022
Year of Publication 27.06.2022
Get full text
Journal Article
Sequential importance sampling for estimating expectations over the space of perfect matchings
Alimohammadi, Yeganeh, Diaconis, Persi, Roghani, Mohammad, Saberi, Amin
Year of Publication 02.07.2021
Year of Publication 02.07.2021
Get full text
Journal Article
Sublinear Metric Steiner Tree via Improved Bounds for Set Cover
Mahabadi, Sepideh, Roghani, Mohammad, Tarnawski, Jakub, Vakilian, Ali
Published in arXiv.org (13.11.2024)
Get full text
Published in arXiv.org (13.11.2024)
Paper
Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting
Gao, Ruiquan, Roghani, Mohammad, Rubinstein, Aviad, Saberi, Amin
Published in arXiv.org (24.09.2024)
Get full text
Published in arXiv.org (24.09.2024)
Paper