Near-Optimal (1 + ϵ)-Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs

Near-Optimal (1 + ϵ)-Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs

Authors
  • Filtser, Arnold
  • Goranci, Gramoz
  • Patel, Neel
  • Probst Gutenberg, Maximilian
Grafik Top
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
65th IEEE Symposium on Foundations of Computer Science (FOCS) 2024
Divisions
Theory and Applications of Algorithms
Subjects
Theoretische Informatik
Event Location
Chicago, IL, USA
Event Type
Conference
Event Dates
October 27-30, 2024
Date
October 2024
Export
Grafik Top