Shortest Two Disjoint Paths in Polynomial Time.

Andreas Björklund Thore Husfeldt

Published in: ICALP (1) (2014)

Keyphrases

disjoint paths
approximation algorithms
special case
worst case
np hard
approximation ratio
undirected graph
shortest path
directed graph
minimum cost
np hardness
shortest common supersequence
data mining
addition chains
computational complexity
frequent patterns
reinforcement learning