The linear arrangement problem parameterized above guaranteed value

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

Volumn 3998 LNCS, Issue , 2006, Pages 356-367

  Gutin, Gregory ^a   Rafiey, Arash ^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

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INTEGER PROGRAMMING; PARAMETER ESTIMATION;

ABSOLUTE VALUE; FIXED-PARAMETER TRACTABLE (FPT); GUARANTEED VALUE; LINEAR ARRANGEMENT (LA);

PROBLEM SOLVING;

EID: 33746103663     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11758471_34     Document Type: Conference Paper

References (19)

1. M. Cesati, Compendium of parameterized problems, Sept. 2005. http://bravo.ce.uniroma2.it/home/cesati/research/compendium.pdf
2. F.R.K. Chung, On optimal linear arrangements of trees. Comp. & Maths, with Appls. 10 (1984), 43-60.
3. R. Diestel, Graph Theory, Springer-Verlag, New York, 2nd ed., 2000.
4. R.G. Downey and M.R. Fellows, Parameterized Complexity, Springer-Verlag, New York, 1999.
5. V. Estivill-Castro, M.R. Fellows, M.A. Langsten, and F.A. Rosamond, FPT is P-Time extremal structure I. In H. Broersma, M. Johnson, and S. Szeider, editors, Algorithms and Complexity in Durham 2005, Proceedings of the first ACiD Workshop, volume 4 of Texts in Algorithmics, pages 1-41. King's College Publications, 2005.
6. H. Fernau, Parameterized Algorithmics: A Graph-theoretic Approach. Habilitation thesis, U. Tübingen, 2005.
7. H. Fernau, Parameterized Algorithmics for Linear Arrangement Problems. Talk at Dagstuhl, July 2005, slides at http://www.dagstuhl.de/files/Materials/ 05/05301/05301.FernauHenning.Slides.pdf
8. H. Fernau, Parameterized Algorithmics for Linear Arrangement Problems. Manscript, July 2005, http://homepages.feis.herts.ac.uk/~comrhf/papers/ola.pdf
9. J. Flum and M. Grohe, Describing parameterized complexity classes. Information and Computation 187 (2003), 291-319.
10. J. Flum and M. Grohe, Parameterized Complexity Theory, Springer, 2006.
11. M. R. Garey and D. R. Johnson, Computers and Intractability, W.H. Freeman & Comp., New York, 1979.
12. M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1 (1976), 237-267.
13. M.K. Goldberg and I.A. Klipker, Minimal placing pf trees on a line. Tech. Report, Physico-Technical Institute of Low Temperatures, Ukranian SSR Acad, of Sciences, USSR, 1976. [In Russian]
14. L.H, Harper, Optimal assignments of numbers to vertices. J. Soc. Indust. Appl. Math. 12 (1964) 131-135.
15. M. Mahajan and V. Raman, Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms 31 (1999), 335-354.
16. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, Oxford University Press, 2006. Forthcoming.
17. Y. Shiloach, A minimum linear arrangement algorithm for undirected trees. SIAM J. Comp. 8 (1979), 15-32.
18. M. Serna and D.M. Thilikos, Parameterized complexity for graph layout problems. EATCS Bulletin 86 (2005), 41-65.
19. R.E. Tarjan, Depth first search and linear graph algorithms. SIAM J. Comput. 1 (1972), 146-160.