Sciweavers

790 search results - page 27 / 158
» Subexponential Parameterized Algorithms
Sort
View
IPL
2008
129views more  IPL 2008»
15 years 8 days ago
Parameterized approximation of dominating set problems
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...
Rodney G. Downey, Michael R. Fellows, Catherine Mc...
AAIM
2008
Springer
90views Algorithms» more  AAIM 2008»
15 years 6 months ago
Facility Location Problems: A Parameterized View
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, ...
Michael R. Fellows, Henning Fernau
TAMC
2007
Springer
15 years 6 months ago
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
Michael Dom, Jiong Guo, Rolf Niedermeier
ICALP
2009
Springer
16 years 17 days ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams
WADS
2007
Springer
114views Algorithms» more  WADS 2007»
15 years 6 months ago
Improved Algorithms for the Feedback Vertex Set Problems
Abstract. We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5k kn2 ). The algor...
Jianer Chen, Fedor V. Fomin, Yang Liu 0002, Songji...