On minimum cost edge searching.

Dariusz Dereniowski Danny Dyer

Published in: Theor. Comput. Sci. (2013)

Keyphrases

minimum cost
undirected graph
np hard
approximation algorithms
network flow
spanning tree
network flow problem
network simplex algorithm
edge detection
worst case
minimum cost flow
capacity constraints
shortest path
scheduling problem
lower bound
edit operations
search algorithm