Author:
Bader David A.,Hart William E.,Phillips Cynthia A.
Publisher
Kluwer Academic Publishers
Reference123 articles.
1. K. M. Anstreicher and N. W. Brixius. A new bound for the quadratic assignment problem based on convex quadratic programming. Mathematical Programming, 89: 341–357, 2001.
2. K.M. Anstreicher, N.W. Brixius, J.-P. Goux, and J. Linderoth. Solving large quadratic assignment problems on computational grids. Mathematical Programming, Series B, 91: 563–588, 2002.
3. D. A. Bader. An improved randomized selection algorithm with an experimental study. In Proceedings of the 2nd Workshop on Algorithm Engineering and Experiments (ALENEX00), pages 115–129, San Francisco, CA, January 2000. www.cs.unm.edu/Conferences/ALENEX00/.
4. D. A. Bader and G. Cong. A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS2004), Santa Fe, NM, April 2004.
5. D. A. Bader and G. Cong. Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2004), Santa Fe, NM, April 2004.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献