Work

Near-Optimal $\left(1+\epsilon\right)-\text{Approximate}$ Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs

Year: 2024

Type: conference-paper

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/focs61266.2024.00124

Authors: Arnold Filtser, Gramoz Goranci, Neel Patel, Maximilian Probst Gutenberg

Institutions: Bar-Ilan University, University of Vienna, University of Southern California, ETH Zurich

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

Funders: Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung, Israel Science Foundation

Awards: Algorithms and complexity for high-accuracy flows and convex optimization, G918616181

OpenAlex ID: W4404848045

FWCI:

Cites: 58

Cited by:

Related to: 10