Betweenness parameterized above tight lower bound

Journal of Computer and System Sciences

Volumn 76, Issue 8, 2010, Pages 872-878

  Gutin, Gregory ^a   Kim, Eun Jung ^a   Mnich, Matthias ^b   Yeo, Anders ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Betweenness; Fixed parameter tractable; Kernel; Parameterized problems; Polynomial kernel; Probabilistic method

Indexed keywords

MOLECULAR BIOLOGY; PARAMETERIZATION;

BETWEENNESS; FIXED-PARAMETER TRACTABLE; KERNEL; PARAMETERIZED PROBLEMS; POLYNOMIAL KERNELS; PROBABILISTIC METHODS;

CONSTRAINT SATISFACTION PROBLEMS;

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

References (31)

1. N. Alon, M. Bǎdoiu, E.D. Demaine, M. Farach-Colton, M. Hajiaghayi, A. Sidiropoulos, Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics, ACM Trans. Algorithms 4 (4) (2008) 1-21.
2. 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.
3. M. Bǎdoiu, E.D. Demaine, M. Hajiaghayi, A. Sidiropoulos, M. Zadimoghaddam, Ordinal embedding: Approximation algorithms and dimensionality reduction, in: APPROX-RANDOM, 2008, pp. 21-34.
4. Y. Bilu, N. Linial, Monotone maps, sphericity and bounded second eigenvalue, J. Combin. Theory Ser. B 95 (2) (2005) 283-299.
5. H.L. Bodlaender, R.G. Downey, M.R. Fellows, D. Hermelin, On problems without polynomial kernels, in: ICALP (1), 2008, pp. 563-574.
6. A. Bonami, Étude des coefficients de Fourier des fonctions de Lp (G), Ann. Inst. Fourier 20 (2) (1970) 335-402.
7. M. Charikar, V. Guruswami, R. Manokaran, Every permutation CSP of arity 3 is approximation resistant, in: Computational Complexity, 2009, CCC '09. 24th Annual IEEE Conference, July 2009, pp. 62-73.
8. B. Chor, M. Sudan, A geometric approach to betweenness, SIAM J. Discrete Math. 11 (4) (1998) 511-523 (electronic).
9. D. Cox, M. Burmeister, E. Price, S. Kim, R. Myers, Radiation hybrid mapping: A somatic cell genetic method for constructing high-resolution maps of mammalian chromosomes, Science 250 (4978) (1990) 245-250.
10. R. Crowston, G. Gutin, M. Jones, Note on Max Lin-2 above average, Inform. Process. Lett. 110 (2010) 451-454.
11. R. Crowston, G. Gutin, M. Jones, E.J. Kim, I. Ruzsa, Systems of linear equations over F2 and problems parameterized above average, SWAT, in press.
12. R. Downey, M. Fellows, Parameterized Complexity, Springer-Verlag, New York, 1999.
13. J. Flum, M. Grohe, Parameterized Complexity Theory, Springer-Verlag, 2006.
14. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of np-Completeness, A Series of Books in the Mathematical Sciences, W.H. Freeman and Co., San Francisco, California, 1979.
15. S. Goss, H. Harris, New methods for mapping genes in human chromosomes, Nature 255 (1975) 680-684.
16. L. Gross, Logarithmic Sobolev inequalities, Amer. J. Math. 97 (1975) 1061-1083.
17. J. Guo, R. Niedermeier, Invitation to data reduction and problem kernelization, SIGACT News 38 (1) (2007) 31-45.
18. G. Gutin, D. Karapetyan, A selection of useful theoretical tools for the design and analysis of optimization heuristics, Memetic Computing 1 (1) (2009) 25-34.
19. G. Gutin, E.J. Kim, S. Szeider, A. Yeo, Probabilistic approach to problems parameterized above or below tight bounds, in: IWPEC 2009, in: Lecture Notes in Comput. Sci., vol. 5917, Springer Berlin, Heidelberg, 2009, pp. 234-245.
20. G. Gutin, A. Rafiey, S. Szeider, A. Yeo, The linear arrangement problem parameterized above guaranteed value, Theory Comput. Syst. 41 (3) (2007) 521-538.
21. G. Gutin, S. Szeider, A. Yeo, Fixed-parameter complexity of minimum profile problems, Algorithmica 52 (2) (2008) 133-152.
22. G. Gutin, L. van Iersel, M. Mnich, A. Yeo, All ternary permutation constraint satisfaction problems parameterized above average have polynomial kernels, Tech. Report at http://arxiv.org/abs/1004.1956, 2010.
23. W. Guttmann, M. Maucher, Variations on an ordering theme with constraints, in: IFIP TCS, 2006, pp. 77-90.
24. M. Karpinski, W. Schudy, Approximation schemes for the betweenness problem in tournaments and related ranking problems, Tech. Report at http://arxiv.org/abs/0911.2214, 2009.
25. A. Krokhin, P. Jeavons, P. Jonsson, Constraint satisfaction problems on intervals and lengths, SIAM J. Discrete Math. 17 (3) (2004) 453-477 (electronic).
26. M. Mahajan, V. Raman, Parameterizing above guaranteed values: MaxSat and MaxCut, J. Algorithms 31 (2) (1999) 335-354.
27. M. Mahajan, V. Raman, S. Sikdar, Parameterizing above or below guaranteed values, J. Comput. System Sci. 75 (2) (2009) 137-153.
28. Y. Makarychev, Simple linear time approximation algorithm for betweenness, Technical Report MSR-TR-2009-74, Microsoft Research New England, June 2009.
29. R. Niedermeier, Invitation to Fixed-Parameter Algorithms, Oxford University Press, Oxford, 2006.
30. J. Opatrný, Total ordering problem, SIAM J. Comput. 8 (1) (1979) 111-114.
31. Y. Villanger, P. Heggernes, C. Paul, J.A. Telle, Interval completion is fixed parameter tractable, SIAM J. Comput. 38 (5) (2008) 2007-2020.