Online Minimum Cost Matching with Recourse on the Line.

Nicole Megow Lukas Nölke

Published in: APPROX-RANDOM (2020)

Keyphrases

minimum cost
np hard
spanning tree
network flow
approximation algorithms
network flow problem
pattern matching
linear program
network simplex algorithm
matching algorithm
graph matching
integer program
multistage
capacity constraints
minimum cost flow
np complete
computational complexity
undirected graph