2496 search results - page 16 / 500 » On covering by translates of a set |
STOC
2005
ACM
16 years 2 days ago
2005
ACM
SODA
2010
ACM
15 years 9 months ago
2010
ACM
FSKD
2007
Springer
15 years 6 months ago
2007
Springer
FCCM
2002
IEEE
15 years 4 months ago
2002
IEEE
128
click to vote
APPROX
2000
Springer
15 years 4 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...