34 search results - page 2 / 7 » On Miniaturized Problems in Parameterized Complexity Theory |
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
ECCC
2007
13 years 5 months ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
ACID
2006
13 years 6 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...