A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs
Computational Complexity
2019-09-19 v1 Combinatorics
Abstract
The paper presents a polynomial time approximation schema for the edge-weighted version of maximum k-vertex cover problem in bipartite graphs.
Keywords
Cite
@article{arxiv.1909.08435,
title = {A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs},
author = {Vangelis Th. Paschos},
journal= {arXiv preprint arXiv:1909.08435},
year = {2019}
}