IEEE Symposium on Foundations of Computer Science (FOCS)
Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple Polygon.
简单多边形中凸覆盖和隐藏集的常数因子近似算法。
2023
Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!
负权单源最短路径在近线性时间内的求解:速度更快了!
2023
Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles.
依赖随机图中的算法去相关与植入团:额外三角形的情况
2023
Parallel Repetition for the GHZ Game: Exponential Decay.
GHZ游戏的并行重复:指数衰减。
2023
Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques.
更快的高精度多商品流从单商品技术中获得。
2023
Deterministic Fully Dynamic SSSP and More.
确定性全动态单源最短路径及更多。
2023
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow.
确定性近线性时间最小费用流算法。
2023
Separating MAX 2-AND, MAX DI-CUT and MAX CUT.
分离MAX 2-AND、MAX DI-CUT和MAX CUT。
2023
The Vector Balancing Constant for Zonotopes.
超平行体向量平衡常数。
2023
Bridge Girth: A Unifying Notion in Network Design.
桥梁周长:网络设计中的统一概念。
2023
uMi+K6
Yrq8XY
IEEE Symposium on Foundations of Computer Science
8JkxjF
CCF: A
CORE: A*
THCPL: A
2QmHnr
Year: 2024
Place: Chicago, IL, USA
Date: October 27-30, 2024
Timeline:
Abstract Deadline: N/A
Deadline: 2024-04-04T20:00:00-05:00