Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles-MedSci.cn

Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles

Dalirrooyfard, M; Jin, C; Williams, VV; Wein, N

Dalirrooyfard, M (通讯作者)，MIT, EECS, 77 Massachusetts Ave, Cambridge, MA 02139 USA.;Dalirrooyfard, M (通讯作者)，MIT, CSAIL, 77 Massachusetts Ave, Cambridge, MA 02139 USA.

2022 IEEE 63RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2022; (): 290

科室
- - 订阅+
  - 更多科室
工具
服务