32 search results - page 3 / 7 » Multicovering Bounds from Relative Covering Radii |
IPCO
2010
13 years 6 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...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
DSD
2003
IEEE
13 years 10 months ago
2003
IEEE
Increasing link speeds have placed enormous burden on the processing requirements and the processors are expected to carry out a variety of tasks. Network Processors (NP) [1] [2] ...
IJCGA
2008
13 years 4 months ago
2008
Given a set P of points (clients) in the plane, a Euclidean 2-centre of P is a set of two points (facilities) in the plane such that the maximum distance from any client to its ne...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...