Sciweavers

2496 search results - page 16 / 500

» On covering by translates of a set

130

Voted

STOC
2005
ACM

89views Algorithms» more STOC 2005»

Universal approximations for TSP, Steiner tree, and set cover

16 years 6 months ago

Universal approximations for TSP, Steiner tree, and set cover

Download www.ccs.neu.edu

Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan R...

claim paper

Read More »

160

SODA
2010
ACM

397views Algorithms» more SODA 2010»

A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover

16 years 3 months ago

A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover

Download www.cs.cmu.edu

Nikhil Bansal, Anupam Gupta, Ravishankar Krishnasw...

claim paper

Read More »

127

FSKD
2007
Springer

114views Fuzzy Logic» more FSKD 2007»

A Class of Covering-Based Fuzzy Rough Sets

16 years 8 days ago

A Class of Covering-Based Fuzzy Rough Sets

Download math.fjnu.edu.cn

W. Zhu

claim paper

Read More »

146

FCCM
2002
IEEE

131views VLSI» more FCCM 2002»

Custom Computing Machines for the Set Covering Problem

15 years 11 months ago

Custom Computing Machines for the Set Covering Problem

Download homepages.uni-paderborn.de

Christian Plessl, Marco Platzner

claim paper

Read More »

223

APPROX
2000
Springer

190views Algorithms» more APPROX 2000»

Approximating node connectivity problems via set covers

15 years 10 months ago

Approximating node connectivity problems via set covers

Download www.crab.rutgers.edu

Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...

Guy Kortsarz, Zeev Nutov

claim paper

Read More »

« Prev « First page 16 / 500 Last » Next »