Highly Influential

@article{Miao2017ApproximationFV, title={Approximation for vertex cover in β-conflict graphs}, author={Dongjing Miao and Zhipeng Cai and Weitian Tong and Jianzhong Li}, journal={J. Comb. Optim.}, year={2017}, volume={34}, pages={1052-1059} }

- Published 2017 in J. Comb. Optim.
DOI:10.1007/s10878-017-0127-z

Conflict graph is a union of finite given sets of disjoint completemultipartite graphs. Vertex cover on this kind of graph is used first to model data inconsistency problems in database application. It is NP-complete if the number of given sets r is fixed, and can be approximated within 2 − 1 2r (Miao et al. in Proceedings of the 9th international… CONTINUE READING

### Presentations referencing similar topics