Minimum cost perfect matching with delays for two sources.

Yuval Emek Yaacov Shapiro Yuyi Wang

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

Keyphrases

minimum cost
np hard
spanning tree
approximation algorithms
capacity constraints
network flow problem
network flow
network simplex algorithm
matching algorithm
minimum cost flow
graph matching
undirected graph
pattern matching
image matching
distance measure
edit operations
data sources