Decorous lower bounds for minimum linear arrangement

INFORMS Journal on Computing

Volumn 23, Issue 1, 2011, Pages 26-40

  Caprara, Alberto ^a   Letchford, Adam N ^b   Salazar González, Juan José ^c  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b LANCASTER UNIVERSITY   (United Kingdom)

^c UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Analysis of algorithms; Graphs, applications; Networks; Programming, integer, algorithm, branch and bound; Programming, integer, applications

Indexed keywords

EID: 79952395307     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1100.0390     Document Type: Article

References (31)

1. Amaral, A. R. S., A. N. Letchford. 2006. A polyhedral approach to the single row facility layout problem. Working paper, Lancaster University, Lancaster, UK.
2. Ambühl, C., M. Mastrolilli, O. Svensson. 2007. Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained scheduling. Proc. 48th Annual IEEE Sympos. Foundations Comput. Sci., IEEE Computer Society Press, Los Alamitos, CA, 329-337.
3. Bornstein, C. F., S. Vempala. 2004. Flow metrics. Theoret. Comput. Sci. 321(1) 13-24.
4. Caprara, A., J. J. Salazar-González. 2005. Laying out sparse graphs with provably minimum bandwidth. INFORMS J. Comput. 17(3) 356-373. (Pubitemid 41342315)
5. Caprara, A., M. Jung, M. Oswald, G. Reinelt, E. Traversi. 2009. A betweenness approach for solving the linear arrangement problem. Working paper, DEIS, Universitá di Bologna, Bologna, Italy.
6. Charikar, M., M. T. Hajiaghayi, H. Karloff, S. Rao. 2010. l2 2 spreading metrics for vertex ordering problems. Algorithmica 56(4) 577-604.
7. Chung, F. R. K. 1988. Labellings of graphs. L. Beineke, R. Wilson, eds. Selected Topics in Graph Theory 3. Academic Press, San Diego, 151-168.
8. Devanur, N. R., S. A. Khot, R. Saket, N. K. Vishnoi. 2006. On the hardness of minimum linear arrangement. Working paper, Georgia Institute of Technology, Atlanta.
9. Díaz, J., J. Petit, M. Serna. 2002. A survey of graph layout problems. ACM Comput. Surveys 34(3) 313-356.
10. Easton, T., S. B. Horton, R. G. Parker. 1996. A solvable case of the optimal linear arrangement problem on Halin graphs. Congressus Numerantium 119 3-17.
11. Even, G., J. S. Naor, S. Rao, B. Schieber. 2000. Divide-and-conquer approximation algorithms via spreading metrics. J. ACM 47(4) 585-616.
12. Feige, U., J. R. Lee. 2007. An improved approximation ratio for the minimum linear arrangement problem. Inform. Processing Lett. 101(1) 26-29. (Pubitemid 44635488)
13. Frederickson, G. N., S. E. Hambrush. 1988. Planar linear arrangements of outerplanar graphs. IEEE Trans. Circuits Systems 35(3) 323-332.
14. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: An Introduction to the Theory of P-Completeness. Freeman, New York.
15. Garey, M. R., D. S. Johnson, L. J. Stockmeyer. 1976. Some simplified P-complete graph problems. Theoret. Comput. Sci. 1(3) 237-267.
16. Grötschel, M., L. Lovász, A. J. Schrijver. 1988. Geometric Algorithms and Combinatorial Optimization. John Wiley & Sons, New York.
17. Harper, L. H. 1964. Optimal assignments of numbers to vertices. SIAM J. Appl. Math. 12(1) 131-135.
18. Juvan, M., B. Mohar. 1992. Optimal linear labelings and eigenvalues of graphs. Discrete Appl. Math. 36(2) 153-168.
19. Koren, Y., D. Harel. 2002. A multi-scale algorithm for the linear arrangement problem. L. Kučera, ed. Proc. 28th Internat. Workshop Graph-Theoretic Concepts in Comput. Sci. Lecture Notes in Computer Science, Vol. 2573. Springer, Berlin, 293-306.
20. Liu, W., A. Vannelli. 1995. Generating lower bounds for the linear arrangement problem. Discrete Appl. Math. 59(2) 137-151.
21. Mitchison, G., R. Durbin. 1986. Optimal numberings of an n × n array. SIAM J. Discrete Math. 7(4) 571-582.
22. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. Wiley, Chichester, UK.
23. Muradyan, D. O., T. E. Piliposjan. 1980. Minimal numberings of vertices of a rectangular lattice. Akademii Nauk Armianskoi SSR 1(70) 21-27 (in Russian).
24. Petit, J. 2001. Layout problems. Ph.D. thesis, Department of Languages and Information Systems, Universitat Politécnica de Catalunya, Barcelona, Spain.
25. Petit, J. 2003a. Combining spectral sequencing and parallel simulated annealing for the MinLA problem. Parallel Processing Lett. 13(1) 77-91.
26. Petit, J. 2003b. Experiments on the linear arrangement problem. J. Experiment. Algorithmics 8 Article 2.3.
27. Rao, S., A. W. Richa. 2005. New approximation techniques for some linear ordering problems. SIAM J. Comput. 34(2) 388-404. (Pubitemid 40645168)
28. Reinelt, G. 2009. Personal communication.
29. Rodriguez-Tello, E., J.-K. Hao, J. Torres-Jimenez. 2008. An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem. Comput. Oper. Res. 35(10) 3331-3346. (Pubitemid 351335150)
30. Safro, I., D. Ron, A. Brandt. 2006. Graph minimum linear arrangement by multilevel weighted edge contractions. J. Algorithms 60(1) 24-41. (Pubitemid 43737249)
31. Shiloach, Y. 1979. A minimum linear arrangement algorithm for undirected trees. SIAM J. Comput. 8(1) 15-32.