Shortest k-Disjoint Paths via Determinants.

Samir Datta Siddharth Iyer Raghav Kulkarni Anish Mukherjee

Published in: CoRR (2018)

Keyphrases

disjoint paths
approximation algorithms
shortest path
directed graph
np hard
undirected graph
shortest common supersequence
service quality
database
minimum cost
path length
knowledge base
case study
end users