A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs.
Rajesh ChitnisPublished in: SIAM J. Discret. Math. (2023)
Keyphrases
- disjoint paths
- lower bound
- upper bound
- undirected graph
- approximation algorithms
- directed acyclic graph
- directed graph
- worst case
- np hard
- branch and bound algorithm
- branch and bound
- optimal solution
- lower bounding
- objective function
- belief networks
- sample complexity
- lower and upper bounds
- image segmentation
- random walk
- planar graphs
- polynomial approximation
- multiscale