ACM-SIAM Symposium on Discrete Algorithms (SODA)
An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism.
平面高阶Voronoi图的最优算法:非确定性的实用性。
2024
Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns.
通过禁止乘积模式的0-1矩阵对避免模式的排列进行排序。
2024
Tight Lower Bound on Equivalence Testing in Conditional Sampling Model.
条件采样模型中等价性检验的紧下界。
2024
Beyond the Quadratic Time Barrier for Network Unreliability.
超越二次时间障碍的网络不可靠性研究。
2024
A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions.
一场全新的比赛:矩阵博弈与光滑函数最大值最小化的原始加速方法。
2024
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds.
在多项对数轮数内打破相关聚类的3因子近似。
2024
A (3 + ɛ)-Approximate Correlation Clustering Algorithm in Dynamic Streams.
动态流中 (3 + ɛ)-近似相关聚类算法。
2024
On the Hardness of PosSLP.
关于PosSLP的难度。
2024
A (3 + ɛ)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds.
带异常值和广义下界扩展的最小半径和问题的 (3 + ɛ)-近似算法。
2024
Maintaining Matroid Intersections Online.
在线维护拟阵交集。
2024
uMi+K6
Yrq8XY
ACM-SIAM Symposium on Discrete Algorithms
8JkxjF
CCF: A
CORE: A*
THCPL: A
2QmHnr
Year: 2025
Place: New Orleans, Louisiana, USA
Date: January 12-15, 2025
Timeline:
Abstract Deadline: N/A
Deadline: 2024-07-05T23:59:59-12:00