STOC 2020

Session 2A - New Algorithms and Hardness for Incremental SSSP in Directed Graphs

Sep 19, 2020

|

23 views

Association for Computing Machinery (ACM)

Details

Full title: New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs

Category: STOC 2020

Comments

loading...

Reactions (0) | Note

📝 No reactions yet

Be the first one to share your thoughts!

Reactions(0)

Note

loading...

Recommended

ICAPS 2014: Daniel Harabor on "Improving Jump Point Search"

ICAPS | Jul 2, 2014

ICAPS 2014 Invited Talk: Peter Wurman

ICAPS | Jul 2, 2014

ICAPS 2014: Mike Phillips on "PA*SE: Parallel A* for Slow Expansions"

ICAPS | Jul 3, 2014

ICAPS 2014: Vidal Alcázar on "Analyzing the Impact of Partial States..."

ICAPS | Jul 3, 2014

ICAPS 2014: Aijun Bai on "Thompson Sampling Based Monte-Carlo Planning in POMDPs"

ICAPS | Jul 3, 2014