A multilevel algorithm for the minimum 2-sum problem

Journal of Graph Algorithms and Applications

Volumn 10, Issue 2, 2006, Pages 237-258

  Safro, Ilya ^a   Ron, Dorit ^a   Brandt, Achi ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (31)

1. S. Barnard, A. Pothen, and H. Simon. A spectral algorithm for envelope reduction of sparse matrices. Numerical Linear Algebra with Applications, 2(4):317-334, 1995.
2. A. Brandt. Algebraic multigrid theory: The symmetric case. 19:23-56, 1986. Preliminary proceedings of the International Multigrid Conference, April 6-8, 1983, Copper Mountain, CO.
3. A. Brandt. General highly accurate algebraic coarsening. Electronic Trans. Num. Anal. 10 (2000) 1-20, 2000.
4. A. Brandt. Multiscale scientific computation: Review 2001. 2001.
5. A. Brandt, S. McCormick, and J. Ruge. Algebraic multigrid (AMG) for automatic multigrid solution with application to geodetic computations. Technical report, Institute for Computational Studies, Fort Collins, CO, POB 1852, 1982.
6. A. Brandt, S. McCormick, and J. Ruge. Algebraic multigrid (AMG) for sparse matrix equations. In D. J. Evans, editor, Sparsity and its Applications, pages 257-284, 1984.
7. A. Brandt and D. Ron. Chapter 1 : Multigrid solvers and multilevel optimization strategies. In J. Cong and J. R. Shinnerl, editors, Multilevel Optimization and VLSICAD. Kluwer, 2002.
8. A. Brandt, D. Ron, and D. Amit. Multi-level approaches to discrete-state and stochastic problems. In W. Hackbush and U. Trottenberg, editors, Multigrid Methods II, pages 66-99. Springer-Verlag, 1986.
9. W. L. Briggs, V. E. Henson, and S. F. McCormick. A multigrid tutorialsecond edition. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
10. C.-K. Cheng. Linear placement algorithm and applications to vlsi design. Netw., 17(4):439-464, 1987.
11. S. W.-S. D. Ron and A. Brandt. An algebraic multigrid based algorithm for bisectioning general graphs, 2005.
12. T. Davis. University of florida sparse matrix collection. NA Digest, 97(23), 1997.
13. M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete problems. In STOC '74: Proceedings of the sixth annual ACM symposium on Theory of computing, pages 47-63, New York, NY, USA, 1974. ACM Press.
14. A. George and A. Pothen. An analysis of spectral envelope reduction via quadratic assignment problems. SIAM Journal on Matrix Analysis and Applications, 18(3):706-732, 1997.
15. K. Hall. An r - dimensional Quadratic Placement Algorithm. Management Science, 17:217-229, 1970.
16. B. Hendrickson and R. Leland. An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM Journal on Scientific Computing, 16(2):452-469, 1995.
17. G. Karypis and V. Kumar, hmetis 1.5: A hypergraph partitioning package. Tech. Report, Dept. of Computer Science, Univ. of Minnesota, 1998.
18. S. Kirkpatrick. Models of disordered systems. Lecture Notes in Physics, 149. Springer-Verlag, Berlin, 1981.
19. Y. Koren and D. Harel. Multi-scale algorithm for the linear arrangement problem. Proceedings of 28th Inter. Workshop on Graph-Theoretic Concepts, 2002.
20. K. Mehlhorn and S. Näher. Leda: a platform for combinatorial and geometric computing. Commun. ACM, 38(1):96-102, 1995.
21. J. Petit. Approximation heuristics and benchmarkings for the minia problem, 1998.
22. A. Pothen, H. Simon, and L. Wang. Spectral nested dissection. Technical Report CS-92-01, 1992.
23. A. Pothen, H. D. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11(3):430-452, 1990.
24. R. Pozo, J. J. Dongarra, and D. W. Walker. Lapack++: a design overview of object-oriented extensions for high performance linear algebra. In Supercomputing '93: Proceedings of the 1993 ACM/IEEE conference on Supercomputing, pages 162-171, New York, NY, USA, 1993. ACM Press.
25. J. Ruge and K. Stuben. Algebraic Multigrid, pages 73-130. SIAM, 1987.
26. I. Safro, D. Ron, and A. Brandt. Multilevel algorithms for linear ordering problems. Submitted, 2005.
27. I. Safro, D. Ron, and A. Brandt. Graph minimum linear arrangement by multilevel weighted edge contractions. Journal of Algorithms, 60(1), 2006.
28. E. Sharon, A. Brandt, and R. Basri. Fast multiscale image segmentation. In Proceedings IEEE Conference on Computer Vision and Pattern Recognition, pages 70-77, 2000.
29. D. A. Spielman and S.-H. Teng. Spectral partitioning works: Planar graphs and finite element meshes. In IEEE Symposium on Foundations of Computer Science, pages 96-105, 1996.
30. K. Stuben. An introduction to algebraic multigrid, pages 413-532. Academic Press, 2001.
31. K. Stuben. A review of algebraic multigrid. J. Comput Appl. Math., 128(1-2):281-309, 2001.