3415 search results - page 146 / 683 » Lower Bounds for Kernelizations |
134
Voted
CORR
2004
Springer
15 years 4 months ago
2004
Springer
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
151
click to vote
ACID
2006
15 years 5 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
139
click to vote
ESCAPE
2007
Springer
15 years 8 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
126
click to vote
ERSHOV
2003
Springer
15 years 9 months ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
127
click to vote
ISLPED
1998
ACM
15 years 8 months ago
1998
ACM
- The objective of this paper is to provide lower and upper bounds for the switching activity on the state lines in Finite State Machines (FSMs). Using a Markov chain model for the...