Sciweavers

790 search results - page 8 / 158
» Subexponential Parameterized Algorithms
Sort
View
JDA
2006
90views more  JDA 2006»
13 years 9 months ago
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)
Markus Bläser, Bodo Manthey, Jiri Sgall
ICCAD
2007
IEEE
115views Hardware» more  ICCAD 2007»
14 years 6 months ago
Parameterized model order reduction via a two-directional Arnoldi process
Abstract—This paper presents a multiparameter momentmatching based model order reduction technique for parameterized interconnect networks via a novel two-directional Arnoldi pro...
Yung-Ta Li, Zhaojun Bai, Yangfeng Su, Xuan Zeng
WALCOM
2008
IEEE
82views Algorithms» more  WALCOM 2008»
13 years 11 months ago
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
Abstract. Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (...
Henning Fernau, Daniel Raible
ECCC
2007
90views more  ECCC 2007»
13 years 9 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider