Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity.

Chao Liao Qingyun Chen Bundit Laekhanukit Yuhao Zhang

Published in: CoRR (2022)

Keyphrases

single source
shortest path problem
multi source
worst case
lower bound
approximation algorithms
computational complexity
upper bound
np hard
edge detection
shortest path
database
data mining
database systems
special case