The Power of Greedy for Online Minimum Cost Matching on the Line.
Eric BalkanskiYuri FaenzaNoémie PérivierPublished in: CoRR (2022)
Keyphrases
- minimum cost
- np hard
- approximation algorithms
- network flow problem
- network flow
- spanning tree
- network simplex algorithm
- capacity constraints
- matching algorithm
- greedy algorithm
- minimum cost flow
- line segments
- image matching
- string matching
- np complete
- undirected graph
- dynamic environments
- search space
- graph matching
- pattern matching