A nearly optimal algorithm for approximating replacement paths and k shortest simple paths in general graphs
Year: 2010
Type: conference-paper
Source: Symposium on Discrete Algorithms
Author: Aaron Bernstein
Institution: Massachusetts Institute of Technology
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W1998002108
