A probabilistic approach to problems parameterized above or below tight bounds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5917 LNCS, Issue , 2009, Pages 234-245

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

^a UNIVERSITY OF LONDON   (United Kingdom)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FIXED-PARAMETER TRACTABILITY; LOWER BOUNDS; NEW APPROACHES; PARAMETERIZED; PROBABILISTIC APPROACHES; TIGHT BOUND; UPPER BOUND;

CONTROL THEORY;

EID: 72249094201     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11269-0_19     Document Type: Conference Paper

References (18)

1. Alon, N.: Voting paradoxes and digraphs realizations. Advances in Applied Math. 29, 126-135 (2002)
2. Alon, N., Gutin, G., Krivelevich, M.: Algorithms with large domination ratio. J. Algorithms 50(1), 118-131 (2004)
3. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, London (2009)
4. Blyth, T.S., Robertson, E.F.: Basic Linear Algebra. Springer, Heidelberg (2000)
5. p-product spaces. In: Seminar on Functional Analysis (1979-1980) (French)
6. Coppersmith, D.: Solving linear systems over GF(2): block Lanczos algorithm. Lin. Algebra Applic. 192, 33-60 (1993)
7. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
8. Flum, J., Grohe, M.: arameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series, vol. XIV. Springer, Heidelberg (2006)
9. Gutin, G., Kim, E.J., Mnich, M., Yeo, A.: Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound. Tech. Report arXiv:0907.5427
10. Gutin, G., Rafiey, A., Szeider, S., Yeo, A.: The linear arrangement problem parameterized above guaranteed value. Theory Comput. Syst. 41, 521-538 (2007)
11. Gutin, G., Szeider, S., Yeo, A.: Fixed-parameter complexity of minimum profile problems. Algorithmica 52(2), 133-152 (2008)
12. Håstad, J., Venkatesh, S.: On the advantage over a random assignment. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, vol. 25(2), pp. 117-149 (2002)
13. Heggernes, P., Paul, C., Telle, J.A., Villanger, Y.: Interval completion with few edges. In: STOC 2007-Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp. 374-381. ACM, New York (2007);
14. Full version appeared in SIAM J. Comput. 38(5) (2008-2009)
15. Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms 31(2), 335-354 (1999)
16. Mahajan, M., Raman, V., Sikdar, S.: Parameterizing above or below guaranteed values. J. of Computer and System Sciences 75(2), 137-153 (2009)
17. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications. Oxford University Press, Oxford (2006)
18. Vovk, V.: Private communication (August 2009)