Sciweavers

4255 search results - page 108 / 851

» Cover

173

ESA
2011
Springer

242views Algorithms» more ESA 2011»

Cover-Decomposition and Polychromatic Numbers

14 years 3 months ago

Cover-Decomposition and Polychromatic Numbers

Download people.maths.ox.ac.uk

Béla Bollobás, David Pritchard, Thom...

claim paper

Read More »

114

SCW
2012
IEEE

299views Applied Computing» more SCW 2012»

The minimal covering set in large tournaments

13 years 11 months ago

The minimal covering set in large tournaments

Download people.maths.ox.ac.uk

Alex Scott, Mark Fey

claim paper

Read More »

98

STACS
2012
Springer

234views Theoretical Computer Science» more STACS 2012»

Preemptive and Non-Preemptive Generalized Min Sum Set Cover

13 years 11 months ago

Preemptive and Non-Preemptive Generalized Min Sum Set Cover

Download www.cs.illinois.edu

Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan

claim paper

Read More »

119

SODA
2012
ACM

185views Algorithms» more SODA 2012»

Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling

13 years 6 months ago

Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling

Download cs.uwaterloo.ca

Timothy M. Chan, Elyot Grant, Jochen Könemann...

claim paper

Read More »

110

Voted

STOC
2002
ACM

91views Algorithms» more STOC 2002»

The importance of being biased

16 years 4 months ago

The importance of being biased

Download www.cs.cmu.edu

The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...

Irit Dinur, Shmuel Safra

claim paper

Read More »

« Prev « First page 108 / 851 Last » Next »