Approximation for vertex cover in $$\beta $$ β -conflict graphs

Dongjing Miao (), Zhipeng Cai (), Weitian Tong () and Jianzhong Li ()
Additional contact information
Dongjing Miao: Georgia State University
Zhipeng Cai: Georgia State University
Weitian Tong: Georgia Southern University
Jianzhong Li: Harbin Institute of Technology

Journal of Combinatorial Optimization, 2017, vol. 34, issue 4, No 4, 1052-1059

Abstract: Abstract Conflict graph is a union of finite given sets of disjoint complete multipartite 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-\frac{1}{2^r}$$ 2 - 1 2 r (Miao et al. in Proceedings of the 9th international conference on combinatorial optimization and applications, vol 9486. COCOA 2015, New York. Springer, New York, pp 395–408, 2015). This paper shows a better algorithm to improve the approximation for dense cases. If the ratio of vertex not belongs to any wheel complete multipartite graph is no more than $$\beta

Keywords: Approximation algorithm; Vertex cover; Conflict graph; Complete multipartite graph (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0127-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:34:y:2017:i:4:d:10.1007_s10878-017-0127-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-017-0127-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().