4903 search results - page 16 / 981 » The Set Covering Machine |
168
click to vote
APPROX
2000
Springer
15 years 7 months ago
2000
Springer
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...
118
Voted
COCOON
2010
Springer
15 years 7 months ago
2010
Springer
86
Voted
ICALP
2000
Springer
15 years 6 months ago
2000
Springer
EOR
2010
15 years 2 months ago
2010
APAL
2006
15 years 2 months ago
2006
