Sciweavers

4255 search results - page 82 / 851
» Cover
Sort
View
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
15 years 6 months ago
Approximating node connectivity problems via set covers
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
COCOON
2010
Springer
15 years 6 months ago
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
Piotr Berman, Marek Karpinski, Andrzej Lingas
GLVLSI
1999
IEEE
85views VLSI» more  GLVLSI 1999»
15 years 6 months ago
On Applying Set Covering Models to Test Set Compaction
Paulo F. Flores, Horácio C. Neto, Joã...
IFIP
1999
Springer
15 years 6 months ago
Aura II: Combining Negative Thinking and Branch-and-Bound in Unate Covering Problems
Luca P. Carloni, Evguenii I. Goldberg, Tiziano Vil...