On the approximation of maximum $k$-vertex cover in bipartite graphs.
Edouard BonnetBruno EscoffierVangelis Th. PaschosGeorgios StamoulisPublished in: CoRR (2014)
Keyphrases
- bipartite graph
- vertex cover
- approximation algorithms
- polynomial time approximation
- planar graphs
- maximum matching
- np hard
- approximation ratio
- minimum weight
- special case
- partial order
- precedence constraints
- error bounds
- link prediction
- minimum cost
- worst case
- maximum cardinality
- approximation guarantees
- constant factor
- edge weights
- web search