Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays.

Yossi Azar Ashish Chiplunkar Haim Kaplan

Published in: SODA (2017)

Keyphrases

min cost
max flow
network flow
matching algorithm
combinatorial optimization problems
lower bound
upper bound
image matching
np hard
lower and upper bounds