1433 search results - page 33 / 287 » On Covering Problems of Rado |
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
IPCO
2010
15 years 1 months ago
2010
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...
DAM
1999
14 years 11 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
AAAI
2007
15 years 2 months ago
2007
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
MST
2007
14 years 11 months ago
2007
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...