7129 search results - page 93 / 1426 » Approximation Algorithms for Treewidth |
106
click to vote
CEC
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
110
click to vote
DSD
2010
IEEE
15 years 3 months ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
126
click to vote
PR
1998
15 years 2 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
136
click to vote
RECOMB
2010
Springer
15 years 1 months ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
103
click to vote
RSA
2010
15 years 1 months ago
2010
Abstract. We present a randomized approximation algorithm for counting contingency tables, m × n non-negative integer matrices with given row sums R = (r1, . . . , rm) and column ...