Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm.
Yajun WangSam Chiu-wai WongPublished in: ICALP (1) (2015)
Keyphrases
- greedy algorithm
- vertex cover
- bipartite matching
- approximation algorithms
- worst case
- greedy algorithms
- approximation ratio
- objective function
- greedy heuristic
- planar graphs
- minimum cost flow
- dynamic programming
- approximation guarantees
- randomized algorithm
- maximum weight
- polynomial time approximation
- evolutionary algorithm
- influence spread
- knapsack problem
- partial order
- online algorithms
- upper bound
- special case
- genetic algorithm