A probabilistic approach to problems parameterized above or below tight bounds

Journal of Computer and System Sciences

Volumn 77, Issue 2, 2011, Pages 422-429

  Gutin, Gregory ^a   Kim, Eun Jung ^a   Szeider, Stefan ^b   Yeo, Anders ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Above tight bounds; Fixed parameter tractable; Hypercontractive Inequality; Kernel; Parameterized problems; Probabilistic method

Indexed keywords

COMPUTER NETWORKS; SYSTEMS SCIENCE;

FIXED-PARAMETER TRACTABLE; HYPERCONTRACTIVE INEQUALITY; KERNEL; PARAMETERIZED PROBLEMS; PROBABILISTIC METHODS; TIGHT BOUND;

PARAMETERIZATION;

EID: 77955925781     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2010.06.001     Document Type: Article

References (23)

1. N. Alon, G. Gutin, E.J. Kim, S. Szeider, A. Yeo, Solving MAX-r-SAT above a tight lower bound, in: Proc. SODA 2010, 2010, pp. 511-517.
2. N. Alon, G. Gutin, and M. Krivelevich Algorithms with large domination ratio J. Algorithms 50 1 2004 118 131
3. J. Bang-Jensen, and G. Gutin Digraphs: Theory, Algorithms and Applications 2nd edition 2009 Springer-Verlag London
4. T.S. Blyth, and E.F. Robertson Basic Linear Algebra 2000 Springer
5. A. Bonami Étude des coefficients de Fourier des fonctions de Lp (G ) Ann. Inst. Fourier 20 2 1970 335 402
6. D. Coppersmith Solving linear systems over GF (2 ) : block Lanczos algorithm Linear Algebra Appl. 192 1993 33 60
7. R. Crowston, G. Gutin, and M. Jones Note on Max Lin-2 above average Inform. Process. Lett. 110 2010 451 454
8. R. Crowston, G. Gutin, M. Jones, E.J. Kim, and I. Ruzsa Systems of linear equations over F 2 and problems parameterized above average Proc. SWAT 2010 Lecture Notes in Comput. Sci. vol. 6139 2010 164 175
9. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer
10. J. Flum, and M. Grohe Parameterized Complexity Theory 2006 Springer-Verlag
11. L. Gross Logarithmic Sobolev inequalities Amer. J. Math. 97 1975 1061 1083
12. G. Gutin, L. van Iersel, M. Mnich, A. Yeo, All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables, in: Proc. ESA 2010, in press.
13. G. Gutin, E.J. Kim, M. Mnich, and A. Yeo Betweenness parameterized above tight lower bound J. Comput. System Sci. 76 8 2010 872 878
14. G. Gutin, A. Rafiey, S. Szeider, and A. Yeo The linear arrangement problem parameterized above guaranteed value Theory Comput. Syst. 41 2007 521 538
15. G. Gutin, S. Szeider, and A. Yeo Fixed-parameter complexity of minimum profile problems Algorithmica 52 2 2008 133 152
16. J. Håstad, and S. Venkatesh On the advantage over a random assignment Random Structures Algorithms 25 2 2004 117 149
17. M. Mahajan, and V. Raman Parameterizing above guaranteed values: MaxSat and MaxCut J. Algorithms 31 2 1999 335 354
18. M. Mahajan, V. Raman, and S. Sikdar Parameterizing above or below guaranteed values J. Comput. System Sci. 75 2 2009 137 153
19. R. Niedermeier Invitation to Fixed-Parameter Algorithms 2006 Oxford Univ. Press
20. R. O'Donnell Some topics in analysis of Boolean functions Technical report, ECCC Report TR08-055, 2008. Paper for an invited talk at STOC'08 www.eccc.uni-trier.de/eccc-reports/2008/TR08-055/
21. Y. Villanger, P. Heggernes, C. Paul, and J.A. Telle Interval completion is fixed parameter tractable SIAM J. Comput. 38 5 2008 2007 2020
22. V. Vovk, Private communication, August, 2009.
23. R. de Wolf A brief introduction to Fourier analysis on the Boolean cube Theory of Computing Library Graduate Surveys 1 2008 1 20 http:// theoryofcomputing.org