Results 1  10
of
133,129
Parameterized Complexity of Vertex Cover Variants
, 2006
"... Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum ..."
Abstract

Cited by 23 (5 self)
 Add to MetaCart
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum
Properties of Vertex Cover Obstructions
, 2004
"... We study properties of O(k–Vertex Cover) which denotes all forbidden graphs (as minors) to the family of graphs with vertex cover at most k, k ≥ 0. Our main result is to give a tight vertex bound of O(k–Vertex Cover), and then confirm a conjecture made by Liu Xiong that “The cycle C2k+1 is the only ..."
Abstract
 Add to MetaCart
We study properties of O(k–Vertex Cover) which denotes all forbidden graphs (as minors) to the family of graphs with vertex cover at most k, k ≥ 0. Our main result is to give a tight vertex bound of O(k–Vertex Cover), and then confirm a conjecture made by Liu Xiong that “The cycle C2k+1 is the only
Capacitated vertex covering
 JOURNAL OF ALGORITHMS
, 2003
"... In this paper we study the capacitated vertex cover problem, a generalization of the wellknown vertex cover problem. Given a graph G = (V, E) with weights on the vertices, the goal is to cover all the edges by picking a cover of minimum weight from the vertices. When we pick a copy of a vertex, we ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
In this paper we study the capacitated vertex cover problem, a generalization of the wellknown vertex cover problem. Given a graph G = (V, E) with weights on the vertices, the goal is to cover all the edges by picking a cover of minimum weight from the vertices. When we pick a copy of a vertex, we
Evolutionary Algorithms for Vertex Cover
 PROC. OF EVOLUTIONARY PROGRAMMING VII, VOLUME 1447 OF LNCS
, 1998
"... This paper reports work investigating various evolutionary approaches to vertex cover (VC), a wellknown NPHard optimization problem. Central to each of the algorithms is a novel encoding scheme for VC and related problems that treats each chromosome as a binary decision diagram. As a result, the e ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a wellknown NPHard optimization problem. Central to each of the algorithms is a novel encoding scheme for VC and related problems that treats each chromosome as a binary decision diagram. As a result
Vertex cover reconfiguration and beyond
, 2014
"... Abstract. In the Vertex Cover Reconfiguration (VCR) problem, given graph G = (V,E), positive integers k and `, and two vertex covers S and T of G of size at most k, we determine whether S can be transformed into T by a sequence of at most ` vertex additions or removals such that each operation res ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. In the Vertex Cover Reconfiguration (VCR) problem, given graph G = (V,E), positive integers k and `, and two vertex covers S and T of G of size at most k, we determine whether S can be transformed into T by a sequence of at most ` vertex additions or removals such that each operation
Refined Memorisation for Vertex Cover
"... Memorisation is a technique which allows to speed up exponential recursive algorithms at the cost of an exponential space complexity. This technique already leads to the currently fastest algorithm for fixedparameter vertex cover, whose time complexity is O(1.2832 k k 1.5 + kn), where n is the num ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Memorisation is a technique which allows to speed up exponential recursive algorithms at the cost of an exponential space complexity. This technique already leads to the currently fastest algorithm for fixedparameter vertex cover, whose time complexity is O(1.2832 k k 1.5 + kn), where n
Capacitated Vertex Covering with Applications
 Proc. ACMSIAM Symp. on Discrete Algorithms
, 2002
"... In this paper we study the capacitated vertex cover problem, a generalization of the well known vertex cover problem. Given a graph G = (V;E) with weights on the vertices, the goal is to cover all the edges by picking a cover of minimum weight from the vertices. When we pick a copy of a vertex, we p ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
In this paper we study the capacitated vertex cover problem, a generalization of the well known vertex cover problem. Given a graph G = (V;E) with weights on the vertices, the goal is to cover all the edges by picking a cover of minimum weight from the vertices. When we pick a copy of a vertex, we
Refined memorization for vertex cover
, 2004
"... Memorization is a technique which allows to speed up exponential recursive algorithms at the cost of an exponential space complexity. This technique already leads to the currently fastest algorithm for fixedparameter vertex cover, whose time complexity is O(1.2832kk 1.5 + kn), wherenisthenumber of ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Memorization is a technique which allows to speed up exponential recursive algorithms at the cost of an exponential space complexity. This technique already leads to the currently fastest algorithm for fixedparameter vertex cover, whose time complexity is O(1.2832kk 1.5 + kn), wherenisthenumber
The Price of Connectivity for Vertex Cover
"... The vertex cover number of a graph is the minimum number of vertices that are needed to cover all edges. When those vertices are further required to induce a connected subgraph, the corresponding number is called the connected vertex cover number, and is always greater or equal to the vertex cover ..."
Abstract
 Add to MetaCart
The vertex cover number of a graph is the minimum number of vertices that are needed to cover all edges. When those vertices are further required to induce a connected subgraph, the corresponding number is called the connected vertex cover number, and is always greater or equal to the vertex cover
On cutwidth parameterized by vertex cover
"... We study the Cutwidth problem, where input is a graph G, and the objective is find a linear layout of the vertices that minimizes the maximum number of edges intersected by any vertical line inserted between two consecutive vertices of the layout. We give an algorithm for Cutwidth with running tim ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
time O(2 k n O(1)). Here k is the size of a minimum vertex cover of the input graph G, and n is the number of vertices in G. Our algorithm gives a a O(2 n/2 n O(1) ) time algorithm for Cutwidth on bipartite graphs as a corollary. This is the first nontrivial exact exponential time algorithm
Results 1  10
of
133,129