arXiv Open Access 2019

A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs

Vangelis Th. Paschos

Lihat Sumber

Abstrak

The paper presents a polynomial time approximation schema for the edge-weighted version of maximum k-vertex cover problem in bipartite graphs.

cs.CC math.CO

Vangelis Th. Paschos

APA MLA BibTeX

Paschos, V.T. (2019). A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs. https://arxiv.org/abs/1909.08435

Lihat di Sumber

Informasi Jurnal