2496 search results - page 16 / 500 » On covering by translates of a set |
STOC
2005
ACM
14 years 7 months ago
2005
ACM
SODA
2010
ACM
14 years 4 months ago
2010
ACM
FSKD
2007
Springer
14 years 1 months ago
2007
Springer
FCCM
2002
IEEE
14 years 14 days ago
2002
IEEE
APPROX
2000
Springer
13 years 12 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...