Login / Signup
Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays.
Yossi Azar
Ashish Chiplunkar
Haim Kaplan
Published in:
CoRR (2016)
Keyphrases
</>
min cost
max flow
network flow
upper bound
matching algorithm
lower bound
graph model
combinatorial optimization problems
parallel processors
bipartite graph
genetic algorithm
worst case
linear programming
complex networks
minimum cost