Parameterized algorithmics for linear arrangement problems

Discrete Applied Mathematics

Volumn 156, Issue 17, 2008, Pages 3166-3177

  Fernau, Henning ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

Linear arrangement problems; Parameterized algorithms

Indexed keywords

ALGORITHMICS; LINEAR ARRANGEMENT PROBLEMS; LINEAR ARRANGEMENTS; PARAMETERIZED; PARAMETERIZED ALGORITHMS; PROBLEM KERNELS; SEARCH TREE ALGORITHMS;

EID: 55049132756     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.05.008     Document Type: Article

References (30)

1. Adolphson D., and Hu T.C. Optimal linear orderings. SIAM Journal of Applied Mathematics 25 (1973) 403-423
2. Alber J., Dorn B., and Niedermeier R. A general data reduction scheme for domination in graphs. In: Štuller J., Wiedermann J., Tel G., Pokorný J., and Bieliková M. (Eds). Software Seminar SOFSEM. LNCS vol. 3831 (2006), Springer 137-147
3. Alber J., Fernau H., and Niedermeier R. Parameterized complexity: Exponential speedup for planar graph problems. Journal of Algorithms 52 (2004) 26-56
4. Alpert C.J., Chan T.F., Huang D.J.-H., Kahng A.B., Markov I.L., Mulet P., and Yan K. Faster minimization of linear wirelength for global placement. International Symposium on Physical Design ISPD (1997), ACM/IEEE 4-11
5. Bhasker J., and Sahni S. Optimal linear arrangement of circuit components. Journal of VLSI and Computer Systems 2 1-2 (1987) 87-109
6. T. Bier, Some inequalities for linear extensions of posets and ideals, May 2005, unpublished manuscript
7. Borchert B., and Reinhardt K. Searching paths of constant bandwidth. In: Štuller J., Wiedermann J., Tel G., Pokorný J., and Bieliková M. (Eds). Software Seminar SOFSEM. LNCS vol. 3831 (2006), Springer 187-196
8. Chen J., Huang X., Kanj I.A., and Xia G. Polynomial time approximation schemes and parameterized complexity. Mathematical Foundations of Computer Science MFCS 2004. LNCS vol. 3153 (2004), Springer 500-512
9. Díaz J., Petit J., and Serna M. A survey on graph layout problems. ACM Computing Surveys 34 (2002) 313-356
10. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer
11. Dujmović V., Fellows M.R., Hallett M., Kitching M., Liotta G., McCartin C., Nishimura N., Ragde P., Rosamond F.A., Suderman M., Whitesides S., and Wood D.R. A fixed-parameter approach to two-layer planarization. In: Mutzel P., Jünger M., and Leipert S. (Eds). 9th International Symp. on Graph Drawing GD'01. LNCS vol. 2265 (2002), Springer 1-15
12. Dujmović V., Fernau H., and Kaufmann M. Fixed parameter algorithms for one-sided crossing minimization revisited. In: Liotta G. (Ed). Graph Drawing, 11th International Symposium GD 2003. LNCS vol. 2912 (2004), Springer 332-344
13. H. Fernau, Parameterized algorithmics: A graph-theoretic approach, Habilitationsschrift, Universität Tübingen, Germany, 2005
14. Fernau H. Two-layer planarization: Improving on parameterized algorithmics. Journal of Graph Algorithms and Applications 9 (2005) 205-238
15. Garey M.R., and Johnson D.S. Computers and Intractability (1979), Freeman, New York
16. Garey M.R., Johnson D.S., and Stockmeyer L. Some simplified NP-complete graph problems. Theoretical Computer Science 1 (1976) 237-267
17. Gramm J., Hirsch E.A., Niedermeier R., and Rossmanith P. Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discrete Applied Mathematics 130 (2003) 139-155
18. Gutin G., Rafiey A., Szeider S., and Yeo A. The linear arrangement problem parameterized above guaranteed value. In: Calamoneri T., Finocchi I., and Italiano G.F. (Eds). Conference on Algorithms and Complexity CIAC. LNCS vol. 3998 (2006), Springer 356-367
19. Hur S., and Lilis J. Relaxation and clustering in a local search framework: Application to linear placement. 36th Design Automation Conference DAC '99 (1999), SIGDA 360-366
20. Kang S. Linear ordering and applications to placement. Proc. 20th Design and Automation Conference DAC (1983), IEEE/ACM 457-464
21. Mahajan M., and Raman V. Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms 31 2 (1999) 335-354
22. Mitchison G., and Durbin R. Optimal numberings of an n × n array. SIAM Journal on Algebraic Discrete Methods 7 (1986) 571-582
23. Pach J., Shahrokhi F., and Szegedy M. Applications of the crossing number. SCG '94: Proceedings of the Tenth Annual Symposium on Computational Geometry (1994), ACM Press 198-202
24. Petit J. Experiments on the minimum linear arrangement problem. J. Exp. Algorithmics 8 (2003)
25. Ravi R., Agrawal A., and Klein P. Ordering problems approximated: Single processor scheduling and interval graph completion. In: Leach M.R.J., and Monien B. (Eds). ICALP. LNCS vol. 510 (1991), Springer 751-762
26. Reinelt G. The Linear Ordering Problem: Algorithms and Applications (1985), Heldermann
27. Schuler D.M., and Ulrich E. Clustering and linear placement. Proc. 9th Design and Automation Conference DAC (1972), IEEE/ACM 50-56
28. Serna M., and Thilikos D.M. Parameterized complexity for graph layout problems. EATCS Bulletin 86 (2005) 41-65
29. Woeginger G.J. Exact algorithms for NP-hard problems: A survey. In: Juenger M., Reinelt G., and Rinaldi G. (Eds). Combinatorial Optimization - Eureka! You shrink!. LNCS vol. 2570 (2003), Springer 185-207
30. Yang Z., and Areibi S. Global placement for VLSI standard cell design. 15th International Conference on Computer Applications in Industry and Engineering CAINE (2002), ISCA 243-247