Extension of the nemhauser and trotter theorem to generalized vertex cover with applications

Reuven Bar-Yehuda; Dan Hermelin; Dror Rawitz

doi:10.1007/978-3-642-12450-1_2

Extension of the nemhauser and trotter theorem to generalized vertex cover with applications

Reuven Bar-Yehuda, Dan Hermelin, Dror Rawitz

Research output: Contribution to journal › Conference article › peer-review

4 Scopus citations

Abstract

The Nemhauser&Trotter Theorem provides an algorithm which is frequently used as a subroutine in approximation algorithms for the classical Vertex Cover problem. In this paper we present an extension of this theorem so it fits a more general variant of Vertex Cover, namely the Generalized Vertex Cover problem, where edges are allowed not to be covered at a certain predetermined penalty. We show that many applications of the original Nemhauser&Trotter Theorem can be applied using our extension to Generalized Vertex Cover. These applications include a (2 - 2/d )-approximation algorithm for graphs of bounded degree d, a PTAS for planar graphs, a (2-lg lg n/2 lg n )-approximation algorithm for general graphs, and a 2k kernel for the parameterized Generalized Vertex Cover problem.

Original language	English
Pages (from-to)	13-24
Number of pages	12
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOIs	https://doi.org/10.1007/978-3-642-12450-1_2
State	Published - 1 Dec 2009
Externally published	Yes
Event	7th Workshop on Approximation and Online Algorithms, WAOA 2009 - Copenhagen, Denmark Duration: 10 Sep 2009 → 11 Sep 2009

Access to Document

10.1007/978-3-642-12450-1_2

Cite this

@article{1a939f25d65f4535b13bfdaa302947c6,

title = "Extension of the nemhauser and trotter theorem to generalized vertex cover with applications",

abstract = "The Nemhauser&Trotter Theorem provides an algorithm which is frequently used as a subroutine in approximation algorithms for the classical Vertex Cover problem. In this paper we present an extension of this theorem so it fits a more general variant of Vertex Cover, namely the Generalized Vertex Cover problem, where edges are allowed not to be covered at a certain predetermined penalty. We show that many applications of the original Nemhauser&Trotter Theorem can be applied using our extension to Generalized Vertex Cover. These applications include a (2 - 2/d )-approximation algorithm for graphs of bounded degree d, a PTAS for planar graphs, a (2-lg lg n/2 lg n )-approximation algorithm for general graphs, and a 2k kernel for the parameterized Generalized Vertex Cover problem.",

author = "Reuven Bar-Yehuda and Dan Hermelin and Dror Rawitz",

year = "2009",

month = dec,

day = "1",

doi = "10.1007/978-3-642-12450-1_2",

language = "???core.languages.en_GB???",

pages = "13--24",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

}

Extension of the nemhauser and trotter theorem to generalized vertex cover with applications. / Bar-Yehuda, Reuven; Hermelin, Dan; Rawitz, Dror.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 01.12.2009, p. 13-24.

Research output: Contribution to journal › Conference article › peer-review

TY - JOUR

T1 - Extension of the nemhauser and trotter theorem to generalized vertex cover with applications

AU - Bar-Yehuda, Reuven

AU - Hermelin, Dan

AU - Rawitz, Dror

PY - 2009/12/1

Y1 - 2009/12/1

N2 - The Nemhauser&Trotter Theorem provides an algorithm which is frequently used as a subroutine in approximation algorithms for the classical Vertex Cover problem. In this paper we present an extension of this theorem so it fits a more general variant of Vertex Cover, namely the Generalized Vertex Cover problem, where edges are allowed not to be covered at a certain predetermined penalty. We show that many applications of the original Nemhauser&Trotter Theorem can be applied using our extension to Generalized Vertex Cover. These applications include a (2 - 2/d )-approximation algorithm for graphs of bounded degree d, a PTAS for planar graphs, a (2-lg lg n/2 lg n )-approximation algorithm for general graphs, and a 2k kernel for the parameterized Generalized Vertex Cover problem.

AB - The Nemhauser&Trotter Theorem provides an algorithm which is frequently used as a subroutine in approximation algorithms for the classical Vertex Cover problem. In this paper we present an extension of this theorem so it fits a more general variant of Vertex Cover, namely the Generalized Vertex Cover problem, where edges are allowed not to be covered at a certain predetermined penalty. We show that many applications of the original Nemhauser&Trotter Theorem can be applied using our extension to Generalized Vertex Cover. These applications include a (2 - 2/d )-approximation algorithm for graphs of bounded degree d, a PTAS for planar graphs, a (2-lg lg n/2 lg n )-approximation algorithm for general graphs, and a 2k kernel for the parameterized Generalized Vertex Cover problem.

UR - http://www.scopus.com/inward/record.url?scp=78651234596&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-12450-1_2

DO - 10.1007/978-3-642-12450-1_2

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:78651234596

SP - 13

EP - 24

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

Y2 - 10 September 2009 through 11 September 2009

ER -

Extension of the nemhauser and trotter theorem to generalized vertex cover with applications

Abstract

Access to Document

Other files and links

Fingerprint

Cite this