Sciweavers

1424 search results - page 25 / 285

» The Multi-radius Cover Problem

128

NETWORKS
2007

77views Computer Networks» more NETWORKS 2007»

A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs

15 years 6 months ago

A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs

Download www.cs.uoi.gr

Katerina Asdre, Stavros D. Nikolopoulos

claim paper

Read More »

113

MP
2010

79views more MP 2010»

MIP reformulations of the probabilistic set covering problem

15 years 5 months ago

MIP reformulations of the probabilistic set covering problem

Download edoc.hu-berlin.de

Anureet Saxena, Vineet Goyal, Miguel A. Lejeune

claim paper

Read More »

112

CORR
2010
Springer

67views Education» more CORR 2010»

Covering Cubes and the Closest Vector Problem

15 years 4 months ago

Covering Cubes and the Closest Vector Problem

Download infoscience.epfl.ch

Friedrich Eisenbrand, Nicolai Hähnle, Martin ...

claim paper

Read More »

279

ACID
2006

220views Algorithms» more ACID 2006»

Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms

15 years 8 months ago

Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms

Download www.dcs.gla.ac.uk

We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...

Henning Fernau, David Manlove

claim paper

Read More »

170

WEA
2007
Springer

111views Algorithms» more WEA 2007»

Vertex Cover Approximations on Random Graphs

16 years 1 months ago

Vertex Cover Approximations on Random Graphs

Download www.ru.is

Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...

Eyjolfur Asgeirsson, Clifford Stein

claim paper

Read More »

« Prev « First page 25 / 285 Last » Next »