ESA 2003: Algorithms - ESA 2003 pp 289-300

The Minimum Generalized Vertex Cover Problem

  • Refael Hassin
  • Asaf Levin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2832)

Abstract

Let G=(V,E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contributed to the solution by the edge e if exactly i of its endpoints are in the solution. The cost of including a vertex v in the solution is c(v). A solution has cost that is equal to the sum of the vertex costs and the edge costs. The minimum generalized vertex cover problem is to compute a minimum cost set of vertices. We study the complexity of the problem when the costs d0(e)=1, d1(e)=α and d2(e)=0 ∀ e ∈ E and c(v) = β ∀ v ∈ V for all possible values of α and β. We also provide a pair of 2-approximation algorithms for the general case.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Refael Hassin
    • 1
  • Asaf Levin
    • 1
  1. 1.Department of Statistics and Operations ResearchTel-Aviv UniversityTel-AvivIsrael

Personalised recommendations