) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours.

Samuel R. Buss Peter N. Yianilos

Published in: SIAM J. Comput. (1998)

Keyphrases

minimum cost
minimum cost flow
learning algorithm
worst case
network flow
approximation algorithms
optimization problems
finite number
spanning tree
computational complexity
special case
combinatorial optimization
graph matching