加载中…
2019-09-18
A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs
Vangelis Th. Paschos
文献摘要
The paper presents a polynomial time approximation schema for the edge-weighted version of maximum k-vertex cover problem in bipartite graphs.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本