Search Sciweavers | Sciweavers

4903 search results - page 16 / 981

» The Set Covering Machine

217

click to vote

APPROX
2000
Springer

190views Algorithms» more APPROX 2000»

Approximating node connectivity problems via set covers

15 years 10 months ago

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 »

154

click to vote

COCOON
2010
Springer

153views Combinatorics» more COCOON 2010»

Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems

15 years 10 months ago

Download www.cse.psu.edu

Piotr Berman, Marek Karpinski, Andrzej Lingas

claim paper

Read More »

118

click to vote

ICALP
2000
Springer

100views Programming Languages» more ICALP 2000»

Hardness of Set Cover with Intersection 1

15 years 9 months ago

Download www.cs.ust.hk

V. S. Anil Kumar, Sunil Arya, H. Ramesh

claim paper

Read More »

105

click to vote

EOR
2010

87views more EOR 2010»

Surrogate constraint normalization for the set covering problem

15 years 5 months ago

Download faculty.bus.olemiss.edu

José H. Ablanedo-Rosas, César Rego

claim paper

Read More »

103

click to vote

APAL
2006

67views more APAL 2006»

The number of translates of a closed nowhere dense set required to cover a Polish group

15 years 5 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers