Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Prizes
Activities
Press/Media
Student theses
Search by expertise, name or affiliation
Nearly Optimal Approximate Dual-Failure Replacement Paths
Shiri Chechik
*
, Tianyi Zhang
*
Corresponding author for this work
School of Computer Science
School of Electrical Engineering
Research output
:
Contribution to conference
›
Paper
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Nearly Optimal Approximate Dual-Failure Replacement Paths'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Nearly Optimal
100%
Replacement Paths
100%
Dual Failures
100%
Approximate Duals
100%
Time Algorithm
50%
Path Problems
50%
Edge Weight
50%
Weighted Digraph
50%
Shortest Path
25%
Directed Graph
25%
Positive Edges
25%
Cubic-time Algorithm
25%
Edge Failure
25%
Time Barrier
25%
Mathematics
Approximates
100%
Edge
100%
Path Problem
66%
Integer
33%
Main Result
33%
Positive Edge
33%
Natural Generalization
33%
Computer Science
Approximation (Algorithm)
100%
digraph
100%
Directed Graphs
50%
Exist Algorithm
50%
Engineering
Main Result
100%
Single Edge
100%