81 search results - page 3 / 17 » Parameterized algorithmics for linear arrangement problems |
FAW
2007
Springer
14 years 13 days ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
AAIM
2008
Springer
14 years 19 days ago
2008
Springer
Facility Location can be seen as a whole family of problems which have many obvious applications in economics. They have been widely explored in the Operations Research community, ...
CSL
2004
Springer
13 years 11 months ago
2004
Springer
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, ¢¡ , comprised of finite, but arbitrarily many,...
INFORMS
2010
13 years 3 months ago
2010
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
ATAL
2007
Springer
14 years 13 days ago
2007
Springer
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...