Sciweavers

205 search results - page 4 / 41
» On Parameterized Approximability
Sort
View
IPL
2008
129views more  IPL 2008»
13 years 7 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...
AAECC
2007
Springer
117views Algorithms» more  AAECC 2007»
13 years 7 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ý
TAMC
2007
Springer
14 years 1 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
ESA
2004
Springer
119views Algorithms» more  ESA 2004»
14 years 23 days ago
Approximate Parameterized Matching
Carmit Hazay, Moshe Lewenstein, Dina Sokol
MFCS
2004
Springer
14 years 22 days ago
Polynomial Time Approximation Schemes and Parameterized Complexity
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia