1421 search results - page 111 / 285 » Algorithms for subsequence combinatorics |
148
click to vote
COCOON
2003
Springer
15 years 9 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
142
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
163
click to vote
DAM
2007
15 years 4 months ago
2007
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language...
140
click to vote
CCO
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
149
click to vote
CPM
2001
Springer
15 years 9 months ago
2001
Springer
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...