9572 search results - page 30 / 1915 » Cover Algorithms and Their Combination |
STOC
2003
ACM
16 years 3 months ago
2003
ACM
143
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
120
click to vote
DSN
2005
IEEE
15 years 8 months ago
2005
IEEE
Common practice in anomaly-based intrusion detection assumes that one size fits all: a single anomaly detector should detect all anomalies. Compensation for any performance short...
114
click to vote
DCC
2002
IEEE
15 years 3 months ago
2002
IEEE
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribu...
148
click to vote
ISAAC
2000
Springer
15 years 6 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...