Skip to main content
Log in

Approximation for vertex cover in \(\beta \)-conflict graphs

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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}\) (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 <1\), then our algorithm will provide a \((1+\beta +\frac{1-\beta }{k})\)-approximation, where k is a parameter related to degree distribution of wheel complete multipartite graph.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Bar-Yehuda R, Even S (1985) A local-ratio theorem for approximating the weighted vertex cover problem. Ann Discrete Math 25:27–46

    MathSciNet  MATH  Google Scholar 

  • Cheetham J, Dehne F, Rau-Chaplin A, Stege U, Taillon PJ (2003) Solving large FPT problems on coarse-grained parallel machines. J Comput Syst Sci 67(4):691–706

    Article  MathSciNet  MATH  Google Scholar 

  • Chen J, Kanj IA, Xia G (2010) Improved upper bounds for vertex cover. Theor Comput Sci 411(40–42):3736–3756

    Article  MathSciNet  MATH  Google Scholar 

  • Dinur I, Safra S (2005) On the hardness of approximating minimum vertex cover. Ann Math 162(1):439–485

  • Downey RG, Fellows MR (1995) Fixed-parameter tractability and completeness II: on completeness for w[1]. Theor Comput Sci 141(1–2):109–131

    Article  MathSciNet  MATH  Google Scholar 

  • Fang J, Huang Z (2010) Reasoning with inconsistent ontologies. Tsinghua Sci Technol 15(6):687–691

    Article  Google Scholar 

  • Gavril F (1972) Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J Comput 1(2):180–187

    Article  MathSciNet  MATH  Google Scholar 

  • Håstad J (2001) Some optimal inapproximability results. J ACM 48(4):798–859

    Article  MathSciNet  MATH  Google Scholar 

  • Karakostas G (2009) A better approximation ratio for the vertex cover problem. ACM Trans Algorithms 5(4):41:1–41:8

    Article  MathSciNet  MATH  Google Scholar 

  • Khot S, Regev O (2008) Vertex cover might be hard to approximate to within \(2-\epsilon \). J Comput Syst Sci 74(3):335–349

    Article  MathSciNet  MATH  Google Scholar 

  • Kuhn F, Mastrolilli M (2011) Vertex cover in graphs with locally few colors. In: Proceedings of the 38th international colloquim conference on automata, languages and programming, Vol Part I. ICALP’11. Springer, Berlin, pp 498–509

  • Lin G, Cai Z, Lin D (2006) Vertex covering by paths on trees with its applications in machine translation. Inf Process Lett 97(2):73–81

    Article  MathSciNet  MATH  Google Scholar 

  • Liu Y, Wu B, Wang H, Ma P (2014) Bpgm: a big graph mining tool. Tsinghua Sci Technol 19(1):33–38

    Article  Google Scholar 

  • Miao D, Li J, Liu X, Gao H (2015) Vertex cover in conflict graphs: complexity and a near optimal approximation. In: Proceedings of the 9th international conference on combinatorial optimization and applications, vol 9486. COCOA 2015, New York. Springer, New York, Inc, pp 395–408

  • Monien B, Speckenmeyer E (1985) Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Inform 22(1):115–123

    Article  MathSciNet  MATH  Google Scholar 

  • Nemhauser GL, Trotter LE Jr (1975) Vertex packings: structural properties and algorithms. Math Program 8(1):232–248

    Article  MathSciNet  MATH  Google Scholar 

  • Savage CD (1982) Depth-first search and the vertex cover problem. Inf Process Lett 14(5):233–237

    Article  MathSciNet  MATH  Google Scholar 

  • Vazirani VV (2001) Approximation algorithms. Springer, new york

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhipeng Cai.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Miao, D., Cai, Z., Tong, W. et al. Approximation for vertex cover in \(\beta \)-conflict graphs. J Comb Optim 34, 1052–1059 (2017). https://doi.org/10.1007/s10878-017-0127-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-017-0127-z

Keywords

Navigation