2657 search results - page 284 / 532 » On the complexity of hierarchical problem solving |
157
Voted
ALGORITHMICA
2008
15 years 6 months ago
2008
Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent ...
155
click to vote
ANOR
2010
15 years 6 months ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
188
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
201
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
198
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The combination of source coding with decoder side-information (Wyner-Ziv problem) and channel coding with encoder side-information (Gel'fand-Pinsker problem) can be optimall...