Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs.

Yangguang Shi Fa Zhang Zhiyong Liu

Published in: TAMC (2017)

Keyphrases

directed graph
random walk
routing decisions
undirected graph
routing algorithm
total cost
network topology
disjoint paths
directed acyclic graph
computational complexity
learning theory
routing problem
routing protocol
graph structure
shortest path
minimum cost
network topologies
strongly connected
np complete