A note on the submodular vertex cover problem with submodular penalties

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

In this paper, we prove that there exists a combinatorial 3-approximation algorithm for the submodular vertex cover problem with submodular penalties introduced by Xu, Wang, Du, and Wu.

Original languageEnglish
Pages (from-to)95-97
Number of pages3
JournalTheoretical Computer Science
Volume659
DOIs
Publication statusPublished - Jan 10 2017

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'A note on the submodular vertex cover problem with submodular penalties'. Together they form a unique fingerprint.

Cite this