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: Xing Tan on "The Complexity of Partial-Order Plan Viability Problems"

ICAPS | Apr 16, 2015

ICAPS 2014: Nir Lipovetzky and Christina Burt on "Planning for Mining Operations with Time and ..."

ICAPS | Apr 16, 2015

ICAPS 2014: Christopher Expósito-Izquierdo on "Optimization Model and Heuristic Approach for ..."

ICAPS | Apr 16, 2015

ICAPS 2014: Iman Awaad on "Finding Ways to Get the Job Done: An Affordance-Based Approach"

ICAPS | Apr 20, 2015

ICAPS 2014 Invited Talk by Malik Ghallab

ICAPS | May 4, 2015