Experiments on the minimum linear arrangement problem

ACM Journal of Experimental Algorithmics

Volumn 8, Issue , 2003, Pages

  Petit, Jordi ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 39149114888     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/996546.996554     Document Type: Article

References (46)

1. ADOLPHSON, D. 1977. Single machine job sequencing with precedence constraints. SIAM Journal on Computing 6, 40-54.
2. ADOLPHSON, D. AND HU, T. C. 1973. Optimal linear ordering. SIAM Journal on Applied Mathematics 25, 3 (Nov.), 403-423.
3. ATKINS, J. E., BOMAN, E. G., AND HENDRICKSON, B. 1999. A spectral algorithm for seriation and the consecutive ones problem. SIAM Journal on Computing 28, 1, 297-310 (electronic).
4. AUSIELLO, G., CRESCENZI, P., GAMBOSI, G., KANN, V., MARCHETTI-SPACCAMELA, A., AND PROTASI, M. 1999. Complexity and approximation. Springer-Verlag, Berlin.
5. BERRY, J. W. AND GOLDBERG, M. K. 1999. Path optimization for graph partitioning problems. Discrete Applied Mathematics 90, 27-50.
6. BURKARD, R. E., KARISCH, S. E., AND RENDL, F. 1997. QAPLIB - A quadratic assignment problem library. Journal of Global Optimization 391, 10, 391-403.
7. CHUNG, F. R. K. 1988. Labelings of graphs. In Selected topics in graph theory, 3, pp. 151-168. San Diego, California: Academic Press.
8. CONDOR. The Condor project homepage. http://www.cs.wisc.edu/condor/.
9. DÍAZ, J., PENROSE, M. D., PETIT, J., AND SERNA, M. 2000. Convergence theorems for some layout measures on random lattice and random geometric graphs. Combinatorics, Probability and Computing 9, 6, 489-511.
10. DÍAZ, J., PENROSE, M. D., PETIT, J., AND SERNA, M. 2001. Approximating layout problems on random geometric graphs. Journal of Algorithms 39, 1, 78-116.
11. DÍAZ, J., PETIT, J., AND SERNA, M. 2002. A survey on graph layout problems. Technical Report 3.
12. DÍAZ, J., PETIT, J., SERNA, M., AND TREVISAN, L. 2001. Approximating layout problems on random graphs. Discrete Mathematics 235, 1-3, 245-253.
13. th IEEE Symposium on Foundations of Computer Science (1995), pp. 62-71.
14. th IEEE Symposium on Foundations of Computer Science, pp. 12-20.
15. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractability. A guide to the theory of NP-completeness. Freeman and Company.
16. GAREY, M. R., JOHNSON, D. S., AND STOCKMEYER, L. 1976. Some simplified NP-complete graph problems. Theoretical Computer Science 1, 237-267.
17. GOLDBERG, M. K. AND KLIPKER, I. A. 1976. An algorithm for minimal numeration of tree vertices. Sakharth. SSR Mecn. Akad. Moambe 81, 3, 553-556. In Russian (English abstract at MathSciNet).
18. GOMORY, R. E. AND HU, T. C. 1975. Multi-terminal flows in a network, pp. 172-199. Studies in Math., Vol. 11. Math. Assoc. Amer., Washington, D.C.
19. HARPER, L. H. 1964. Optimal assignments of numbers to vertices. Journal of SIAM 12, 1 (March), 131-135.
20. HARPER, L. H. 1970. Chassis layout and isoperimetric problems. Technical Report SPS 37-66, vol II (Sept.), Jet Propulsion Laboratory.
21. th SIAM Conf. Parallel Proc. Sci. Comput.
22. HENDRICKSON, B. AND LELAND, R. 1995. The Chaco user's guide.
23. JOHNSON, D. S. 1990. Local optimization and the traveling salesman problem. In Automata, languages and programming (Coventry, 1990), pp. 446-461. New York: Springer.
24. JOHNSON, D. S., ARAGON, C. R., MCGEOCH, L. A., AND CHEVN, C. S. 1991. Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning. Operations Research 39, 3 (May), 378-405.
25. JOHNSON, D. S., ARAGON, C. R., MCGEOCH, L. A., AND SCHEVON, C. 1989. Optimization by simulated annealing: an experimental evaluation; part I, graph partitioning. Operations Research 37, 6 (Nov.), 865-892.
26. JUELS, A. 1996. Basics in Black-box Combinatorial Optimization. Ph. D. thesis, University of California at Berkeley.
27. JUVAN, M. AND MOHAR, B. 1992. Optimal linear labelings and eigenvalues of graphs. Discrete Applied Mathematics 36, 2, 153-168.
28. KIRKPATRIK, S., GELATT, C. D., AND VECCHI, M. P. 1983. Optimization by simulated annealing. Science 220, 671-680.
29. KLOHS, K. 1999. parSA library user manual (version 2.1a).
30. th Annual ACM-SIAM Symposium on Discrete Algorithms (1993), pp. 212-221.
31. LIU, W. AND VANNELLI, A. 1995. Generating lower bounds for the linear arrangement problem. Discrete Applied Mathematics 59, 137-151.
32. METROPOLIS, W., ROSENBLUTH, A., ROSENBLUTH, M., TELLER, A., AND TELLER, E. 1953. Equation of State Calculations by Fast computing machines. The Journal of Chemical Physics 21, 6, 1087-1092.
33. MITCHISON, G. AND DURBIN, R. 1986. Optimal numberings of an n x n array. SIAM Journal on Algebraic and Discrete Methods 7, 4, 571-582.
34. MURADYAN, D. O. AND PILIPOSJAN, T. E. 1980. Minimal numberings of vertices of a rectangular lattice. Akad. Nauk. Armjan. SRR 1, 70, 21-27. In Russian (English abstract at MathSciNet).
35. NAKANO, K. 1994. Linear layouts of generalized hypercubes. In Graph-theoretic concepts in computer science (Utrecht, 1993), Volume 790 of Lecture Notes in Computer Science, pp. 364-375. Berlin: Springer.
36. OUSTERHOUT, J. K. 1994. Tcl and the Tk Toolkit. Adisson-Wesley.
37. PACH, J., SHAHROKHI, F., AND SZEGEDY, M. 1996. Applications of the crossing number. Algoritmica 16, 111-117.
38. PAPADIMITROU, C. AND STEIGLITZ, K. 1982. Combinatorial Optimization, Algorithms and Complexity. Prentice Hall.
39. PARLETT, B., SIMMON, H., AND STRINGER, L. 1982. Estimating the largest eigenvalue with the Lanczos algorithm. Mathematics of Computation 38, 157, 153-165.
40. PETIT, J. 2003. Combining spectral sequencing and parallel simulated annealing for the MinLA problem. Parallel Processing Letters 13, 1, 77-91.
41. th Annual ACM-SIAM Symposium on Discrete Algorithms (1998), pp. 211-218.
42. RAVI, R., AGRAWAL, A., AND KLEIN, P. 1991. Ordering problems approximated: single-processor scheduling and interval graph completition. In M. R. J. LEACH, B. MONIEN Ed., 18th. International Colloquium on Automata, Languages and Programming, Volume 510 of Lecture Notes in Computer Science (1991), pp. 751-762. Springer-Verlag.
43. REINELT, G. 1991. TSPLIB - A traveling salesman problem library. ORSA Journal on Computing 3, 376-384.
44. SHILOACH, Y. 1979. A minimum linear arrangement algorithm for undirected trees. SIAM Journal on Computing 8, 1 (Feb.), 15-32.
45. SKOROBOHATYJ, G. 1994. Code for finding a minimum cut between all node pairs in an undirected graph. ftp://ftp.zib.de/pub/Packages/mathprog/mincut/all-pairs/index.html.
46. VAN LAARHOVEN, P. J. M. AND AARTS, E. H. L. 1987. Simulated annealing: theory and applications, Volume 37 of Mathematics and its Applications. D. Reidel Publishing Co., Dordrecht.