Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio~0.7.
Vangelis Th. PaschosPublished in: CoRR (2015)
Keyphrases
- bipartite graph
- vertex cover
- approximation algorithms
- planar graphs
- polynomial time approximation
- maximum matching
- np hard
- approximation ratio
- minimum weight
- special case
- partial order
- link prediction
- maximum cardinality
- minimum cost
- precedence constraints
- error bounds
- constant factor
- worst case
- optimal solution
- approximation guarantees
- log likelihood
- edge weights
- computational complexity
- reinforcement learning