A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs
From MaRDI portal
Publication:6325556
arXiv1909.08435MaRDI QIDQ6325556FDOQ6325556
Authors: Vangelis Th. Paschos 
Publication date: 18 September 2019
Abstract: The paper presents a polynomial time approximation schema for the edge-weighted version of maximum k-vertex cover problem in bipartite graphs.
This page was built for publication: A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6325556)
