Sciweavers

9572 search results - page 36 / 1915
» Cover Algorithms and Their Combination
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
KI
2007
Springer
14 years 1 months ago
A Stochastic Local Search Approach to Vertex Cover
We introduce a novel stochastic local search algorithm for the vertex cover problem. Compared to current exhaustive search techniques, our algorithm achieves excellent performance ...
Silvia Richter, Malte Helmert, Charles Gretton
DIS
2004
Springer
14 years 29 days ago
Extracting Minimal and Closed Monotone DNF Formulas
Abstract. In this paper, first we introduce minimal and closed monotone DNF formulas as extensions of maximal and closed itemsets. Next, by incorporating the algorithm dnf cover d...
Yoshikazu Shima, Shinji Mitsuishi, Kouichi Hirata,...
CPM
2010
Springer
127views Combinatorics» more  CPM 2010»
14 years 11 days ago
Cover Array String Reconstruction
A proper factor u of a string y is a cover of y if every letter of y is within some occurrence of u in y. The concept generalises the notion of periods of a string. An integer arra...
Maxime Crochemore, Costas S. Iliopoulos, Solon P. ...
JCO
2010
182views more  JCO 2010»
13 years 6 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu