Sciweavers

205 search results - page 4 / 41
» On Parameterized Approximability
Sort
View
IPL
2008
129views more  IPL 2008»
14 years 10 months 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...
114
Voted
AAECC
2007
Springer
117views Algorithms» more  AAECC 2007»
14 years 10 months ago
A predictor-corrector-type technique for the approximate parameterization of intersection curves
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
Bert Jüttler, Pavel Chalmovianský
96
Voted
TAMC
2007
Springer
15 years 4 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
59
Voted
ESA
2004
Springer
119views Algorithms» more  ESA 2004»
15 years 3 months ago
Approximate Parameterized Matching
Carmit Hazay, Moshe Lewenstein, Dina Sokol
63
Voted
MFCS
2004
Springer
15 years 3 months ago
Polynomial Time Approximation Schemes and Parameterized Complexity
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia