Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems

Journal of Graph Algorithms and Applications

Volumn 5, Issue 4, 2001, Pages 1-27

  Bar Yehuda, Reuven ^a   Even, Guy ^b   Feldman, Jon ^c   Naor, Joseph ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; COMPUTATIONAL COMPLEXITY; DEGREES OF FREEDOM (MECHANICS); OPTIMIZATION; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

ARRANGEMENT PROBLEMS; DECOMPOSITION TREES; DIVIDE-AND-CONQUER; LINEAR ARRANGEMENTS; MINIMUM LINEAR ARRANGEMENT; OPTIMAL ORDERING; OPTIMAL ORIENTATION; RECURSIVE PARTITIONING; VERTEX ORDERING PROBLEM; VERTEX SET;

APPROXIMATION ALGORITHMS;

EID: 0001829586     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00035     Document Type: Article

References (14)

1. [BL84] S.N. Bhatt and F.T. Leighton, "A framework for solving VLSI graph layout problems", JCSS, Vol. 28, pp. 300-343, (1984).
2. [ENRS00] G. Even, J. Naor, S. Rao, and B. Schieber, "Divide-and- Conquer Approximation Algorithms via Spreading Metrics", Journal of the ACM, Volume 47, No. 4, pp. 585 - 616, Jul. 2000.
3. [ENRS99] G. Even, J. Naor, S. Rao, and B. Schieber, "Fast approximate graph partitioning algorithms", SIAM Journal on Computing. Vol-ume 28, Number 6, pp. 2187-2214, 1999.
4. [FD] Frost, D., and Dechter, R. "Maintenance scheduling problems as benchmarks for constraint algorithms" To appear in Annals of Math and AI.
5. [GJ79] M.R. Garey and D.S. Johnson, "Computers and intractability: a guide to the theory of NP-completeness", W. H. Freeman, San Francisco, California, 1979.
6. [GK98] G. Karypis and V. Kumar, "hMeTiS - a hypergraph partitioning package", http://www-users.cs.umn.edu/~karypis/metis/hmetis/les/manual.ps.
7. [Ha89] M. Hansen, "Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems," 30th FOCS, pp. 604-609, 1989.
8. [HL99] Sung-Woo Hur and John Lillis, "Relaxation and clustering in a local search framework: application to linear placement", Proceedings of the 36th ACM/IEEE conference on Design Automation Conference, pp. 360 - 366, 1999.
9. [K93] Richard M. Karp, "Mapping the genome: some combinatorial problems arising in molecular biology", Proceedings of the twentyfifth annual ACM Symposium on Theory of Computing, pp. 278-285, 1993
10. [LR99] F.T. Leighton and S. Rao, "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms", Journal of the ACM, Volume 46, No. 6, pp. 787 - 832, Nov. 1999.
11. [P97] J. Petit, "Approximation Heuristics and Benchmarkings for the MinLA Problem", Tech. Report LSI-97-41-R, Departament de Llenguatges i Sistemes Informàtics. Universitat Politècnica de Catalunya, http://www.lsi.upc.es/dept/techreps/html/R97-41.html, 1997.
12. [RR98] S. Rao and A. W. Richa, "New approximation techniques for some ordering problems", Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 211-218.
13. [RAK91] R. Ravi, A. Agrawal and P. Klein, "Ordering problems approxi-mated: single processor scheduling and interval graph completion", 18th ICALP, pp. 751-762, 1991.
14. [R70] D. J. Rose, "Triangulated graphs and the elimination process", J. Math. Appl., 32 pp. 597-609, 1970.