81 search results - page 7 / 17 » Parameterized algorithmics for linear arrangement problems |
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
ALGORITHMICA
2010
13 years 7 months ago
2010
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space...