205 search results - page 9 / 41 » On Parameterized Approximability |
IWPEC
2009
Springer
14 years 1 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
SGP
2004
13 years 9 months ago
2004
We present a method for parameterizing irregularly triangulated input models over polyhedral domains with quadrilateral faces. A combination of center-based clustering techniques ...
IWPEC
2004
Springer
14 years 23 days ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
DAC
2007
ACM
14 years 8 months ago
2007
ACM
In this paper we propose a novel parameterized macromodeling technique for analog circuits. Unlike traditional macromodels that are only extracted for a small variation space, our...
TIP
2008
13 years 7 months ago
2008
We consider the blind separation of source images from linear mixtures thereof, involving different relative spatial shifts of the sources in each mixture. Such mixtures can be cau...