Sciweavers

4255 search results - page 86 / 851

» Cover

167

FOCS
1991
IEEE

114views Theoretical Computer Science» more FOCS 1991»

Fast Approximation Algorithms for Fractional Packing and Covering Problems

15 years 9 months ago

Fast Approximation Algorithms for Fractional Packing and Covering Problems

Download infolab.stanford.edu

Serge A. Plotkin, David B. Shmoys, Éva Tard...

claim paper

Read More »

143

COCOON
2010
Springer

175views Combinatorics» more COCOON 2010»

The Cover Time of Deterministic Random Walks

15 years 8 months ago

The Cover Time of Deterministic Random Walks

Download www.mpi-inf.mpg.de

Tobias Friedrich, Thomas Sauerwald

claim paper

Read More »

99

DLOG
2007

90views Automated Reasoning» more DLOG 2007»

A General Framework for Covering Concepts using Terminologies

15 years 8 months ago

A General Framework for Covering Concepts using Terminologies

Download sunsite.informatik.rwth-aachen.de

Boualem Benatallah, Mohand-Said Hacid, Alain L&eac...

claim paper

Read More »

165

ICALP
2010
Springer

183views Programming Languages» more ICALP 2010»

Covering and Packing in Linear Space

15 years 8 months ago

Covering and Packing in Linear Space

Download www.cs.lth.se

Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...

Andreas Björklund, Thore Husfeldt, Petteri Ka...

claim paper

Read More »

103

COMPGEOM
2008
ACM

86views Discrete Geometry» more COMPGEOM 2008»

Helly-type theorems for approximate covering

15 years 8 months ago

Helly-type theorems for approximate covering

Download www.postech.ac.kr

Julien Demouth, Olivier Devillers, Marc Glisse, Xa...

claim paper

Read More »

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