The Power of Greedy for Online Minimum Cost Matching on the Line.
Eric BalkanskiYuri FaenzaNoémie PérivierPublished in: EC (2023)
Keyphrases
- minimum cost
- np hard
- network flow
- network flow problem
- approximation algorithms
- spanning tree
- matching algorithm
- greedy algorithm
- minimum cost flow
- capacity constraints
- line segments
- search algorithm
- network simplex algorithm
- graph matching
- special case
- pattern matching
- simulated annealing
- scheduling problem
- search space
- lower bound