22 search results - page 2 / 5 » iwpec 2009 |
IWPEC
2009
Springer
14 years 4 days ago
2009
Springer
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
IWPEC
2009
Springer
14 years 4 days ago
2009
Springer
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
IWPEC
2009
Springer
14 years 4 days ago
2009
Springer
We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents ...
IWPEC
2009
Springer
14 years 4 days ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
IWPEC
2009
Springer
14 years 4 days ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...