1433 search results - page 21 / 287 » On Covering Problems of Rado |
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...
100
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
CCCG
2007
15 years 1 months ago
2007
Given a disk O in the plane called the objective, we want to find n small disks P1, . . . , Pn called the pupils such that n i,j=1 Pi Pj ⊇ O, where denotes the Minkowski diffe...
MEMBRANE
2009
Springer
15 years 6 months ago
2009
Springer
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
