Weighted vertex cover on graphs with maximum degree 3

Dekel Tsur

Weighted vertex cover on graphs with maximum degree 3

Dekel Tsur

Department of Computer Science

Ben-Gurion University of the Negev

Research output: Working paper › Preprint

Abstract

We give a parameterized algorithm for weighted vertex cover on graphs with maximum degree 3 whose time complexity is O∗(1.402t), where t is the minimum size of a vertex cover of the input graph.

Original language	American English
State	Published - 2018

Access to Document

https://dblp.org/rec/journals/corr/abs-1810-12982

Cite this

@techreport{be4cd285e2c64e1ca85089391f763b03,

title = "Weighted vertex cover on graphs with maximum degree 3",

abstract = "We give a parameterized algorithm for weighted vertex cover on graphs with maximum degree 3 whose time complexity is O∗(1.402t), where t is the minimum size of a vertex cover of the input graph.",

author = "Dekel Tsur",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2018",

language = "American English",

type = "WorkingPaper",

}

TY - UNPB

T1 - Weighted vertex cover on graphs with maximum degree 3

AU - Tsur, Dekel

N1 - DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2018

Y1 - 2018

N2 - We give a parameterized algorithm for weighted vertex cover on graphs with maximum degree 3 whose time complexity is O∗(1.402t), where t is the minimum size of a vertex cover of the input graph.

AB - We give a parameterized algorithm for weighted vertex cover on graphs with maximum degree 3 whose time complexity is O∗(1.402t), where t is the minimum size of a vertex cover of the input graph.

M3 - Preprint

BT - Weighted vertex cover on graphs with maximum degree 3

ER -