Login / Signup
Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity.
Chao Liao
Qingyun Chen
Bundit Laekhanukit
Yuhao Zhang
Published in:
ICALP (2022)
Keyphrases
</>
single source
worst case
shortest path problem
multi source
edge detection
upper bound
lower bound
approximation algorithms
genetic algorithm
np hard
shortest path
data sets
artificial neural networks
social network analysis
data fusion