{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:40:10Z","timestamp":1725550810787},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008521"},{"type":"electronic","value":"9783540365693"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36569-9_48","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:12:05Z","timestamp":1269897125000},"page":"703-716","source":"Crossref","is-referenced-by-count":0,"title":["Semidefinite Programming for Graph Partitioning with Preferences in Data Distribution"],"prefix":"10.1007","author":[{"given":"Suely","family":"Oliveira","sequence":"first","affiliation":[]},{"given":"David","family":"Stewart","sequence":"additional","affiliation":[]},{"given":"Takako","family":"Soma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,4,15]]},"reference":[{"issue":"1","key":"48_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"F. Alizadeh. Interior-point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization, 5(1):13\u201351, 1995. 705","journal-title":"SIAM Journal on Optimization"},{"key":"48_CR2","unstructured":"F. Alizadeh, J. P. A. Haeberly, M. V. Nayakkankuppam, M. L. Overton, and S. Schmieta. SDPpack user\u2019s guide-version 0.9 beta for Matlab 5.0. Technical Report TR1997-737, Computer Science Department, New York University, New York, NY, June 1997. 705"},{"key":"48_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1090\/qam\/42792","volume":"9","author":"W. E. Arnoldi","year":"1951","unstructured":"W. E. Arnoldi. The principle of minimized iteration in the solution of the matrix eigenproblem. Quarterly Applied Mathematics, 9:17\u201329, 1951. 709","journal-title":"Quarterly Applied Mathematics"},{"issue":"1","key":"48_CR4","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/10556789908805764","volume":"11","author":"B. Borchers","year":"1999","unstructured":"B. Borchers. CSDP, 2.3 User\u2019s Guide. Optimization Methods and Software, 11(1):597\u2013611, 1999. 705, 712","journal-title":"Optimization Methods and Software"},{"issue":"1","key":"48_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1137\/0915004","volume":"15","author":"M. Crouzeix","year":"1994","unstructured":"M. Crouzeix, B. Philippe, and M. Sadkane. The Davidson method. SIAM J. Sci. Comput., 15(1):62\u201376, 1994. 709","journal-title":"SIAM J. Sci. Comput."},{"key":"48_CR6","unstructured":"K. Fujisawa, M. Kojima, and K. Nakata. SDPA User\u2019s Manual-Version 4.50. Technical Report B, Department of Mathematical and Computing Science, Tokyo Institute of Technology, Tokyo, Japan, July 1999. 705"},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. R. Carey","year":"1976","unstructured":"M. R. Carey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete problems. Theoretical Computer Science, 1:237\u2013267, 1976. 704","journal-title":"Theoretical Computer Science"},{"key":"48_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Graph partitioning and parallel solvers: Has the emperor no clothes? (extended abstract)","author":"B. Hendrickson","year":"1998","unstructured":"B. Hendrickson. Graph partitioning and parallel solvers: Has the emperor no clothes? (extended abstract). In Lecture Notes in Computer Science, volume 1457, 1998. 704"},{"issue":"12","key":"48_CR9","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/S0167-8191(00)00048-X","volume":"26","author":"B. Hendrickson","year":"2000","unstructured":"B. Hendrickson and T. G. Kolda. Graph partitioning models for parallel computing. Parallel Comput., 26(12):1519\u20131534, 2000. 704","journal-title":"Parallel Comput"},{"key":"48_CR10","unstructured":"B. Hendrickson and R. Leland. The Chaco user\u2019s guide, version 2.0. Technical Report SAND-95-2344, Sandia National Laboratories, Albuquerque, NM, July 1995. 705"},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"B. Hendrickson, R. Leland, and R. Van Driessche. Enhancing data locality by using terminal propagation. In Proc. 29th Hawaii Intl. Conf. System Science, volume 16, 1996. 704","DOI":"10.1109\/HICSS.1996.495507"},{"key":"48_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1142\/S0129054199000162","volume":"10","author":"M. Holzrichter","year":"1999","unstructured":"M. Holzrichter and S. Oliveira. A graph basedD avidson algorithm for the graph partitioning problem. International Journal of Foundations of Computer Science, 10:225\u2013246, 1999. 705, 709","journal-title":"International Journal of Foundations of Computer Science"},{"key":"48_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1007\/BFb0097982","volume-title":"A graph basedm ethodfor generating the Fiedler vector of irregular problems","author":"M. Holzrichter","year":"1999","unstructured":"M. Holzrichter and S. Oliveira. A graph basedm ethodfor generating the Fiedler vector of irregular problems. In Lecture Notes in Computer Science, volume 1586, pages 978\u2013985. Springer, 1999. Proceedings of the 11th IPPS\/SPDP\u201999 workshops. 705, 709"},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"S. E. Karisch and F. Rendl. Semidefinite programming and graph equipartition. In P. M. Pardalos and H. Wolkowicz, editors, Topics in Semidefinite and InteriorPoint Methods, volume 18, pages 77\u201395. AMS, 1998. 705","DOI":"10.1090\/fic\/018\/06"},{"key":"48_CR15","unstructured":"G. Karypis and V. Kumar. METIS: Unstructured graph partitioning andsp arse matrix ordering system Version 2.0. Technical report, Department of Computer Science, University of Minnesota, Minneapolis, MN, August 1995. 705"},{"key":"48_CR16","doi-asserted-by":"crossref","first-page":"33","DOI":"10.6028\/jres.049.006","volume":"49","author":"C. Lanczos","year":"1952","unstructured":"C. Lanczos. Solution of systems of linear equations by minimizedit erations. J. Research Nat\u2019l Bureau of Standards, 49:33\u201353, 1952. 709","journal-title":"J. Research Nat\u2019l Bureau of Standards"},{"issue":"2","key":"48_CR17","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s006070050032","volume":"63","author":"S. Oliveira","year":"1999","unstructured":"S. Oliveira. On the convergence rate of a preconditioned subspace eigensolver. Computing, 63(2):219\u2013231, December 1999. 709, 710","journal-title":"Computing"},{"key":"48_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/3-540-45591-4_64","volume-title":"A multilevel algorithm for spectral partitioning with extended eigen-models","author":"S. Oliveira","year":"2000","unstructured":"S. Oliveira and T. Soma. A multilevel algorithm for spectral partitioning with extended eigen-models. In Lecture Notes in Computer Science, volume 1800, pages 477\u2013484. Springer, 2000. Proceedings of the 15th IPDPS 2000 workshops. 704, 706"},{"key":"48_CR19","series-title":"Lect Notes Comput Sci","volume-title":"A subspace semidefinite programming for spectral graph partit ioning","author":"S. Oliveira","year":"2002","unstructured":"S. Oliveira, D. Stewart, and T. Soma. A subspace semidefinite programming for spectral graph partit ioning. In P.M.A Sloot, C.K.K. Tan, J.J. Dongarra, and A. G. Hoekstra, editors, Lecture Notes in Computer Science, volume 2329, pages 10581067. Springer, 2002. Proceedings of International Conference on Computational Science-ICCS 2002, Part 1, Amsterdam, The Netherlands. 704, 709"},{"key":"48_CR20","unstructured":"F. Pellegrini. SCOTCH 3.1 user\u2019s guide. Technical Report 1137-96, Laboratoire Bordelais de Recherche en Informatique, Universite Bordeaux, France, 1996. 705"},{"issue":"3","key":"48_CR21","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"A. Pothen, H. D. Simon, and Kang-Pu K. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11(3):430\u2013452, 1990. 704, 705","journal-title":"SIAM J. Matrix Anal. Appl"},{"key":"48_CR22","unstructured":"R. Preis and R. Diekmann. The PARTY Partitioning-Library, User Guide-Version 1.1. Technical Report tr-rsfb-96-024, University of Paderborn, Germany, 1996. 705"},{"key":"48_CR23","unstructured":"F. Rendl. A Matlab toolbox for semidefinite programming. Technical report, Technische Universitdt Graz, Institut fir Mathematik, Kopernikusgasse 24, A-8010 Graz, Austria, 1994. 705"},{"key":"48_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556789508805599","volume":"5","author":"F. Rendl","year":"1995","unstructured":"F. Rendl, R. J. Vanderbei, and H. Wolkowicz. primal-dual interior point algorithms, and trust region subproblems. Optimization Methods and Software, 5:1\u201316, 1995. 705","journal-title":"Optimization Methods and Software"},{"key":"48_CR25","unstructured":"Y. Saad. Numerical Methods for Large Eigenvalue Problems. Manchester University Press, OxfordR oad, Manchester M13 9PL, UK, 1992. 709"},{"issue":"2","key":"48_CR26","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0895479894270427","volume":"17","author":"G. L. G. Sleijpen","year":"1996","unstructured":"G. L. G. Sleijpen and H. A. Van der Vorst. A Jacobi-Davidson iteration method or linear eigenvalue problems. SIAM J. Matrix Anal. Appl., 17(2):401\u2013425, 1996. Max-min eigenvalue problems, 709","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"48_CR27","unstructured":"D. E. Stewart and Z. Leyk. Meschach: Matrix Computations in C. Australian National University, Canberra, 1994. Proceedings of the CMA, # 32. 712"},{"key":"48_CR28","doi-asserted-by":"crossref","unstructured":"K. C. Toh, M. J. Todd, and P. H. Tiit\u00fcncii. SDPT3-a Matlab software package for semidefinite programming, version 2.1. Technical report, School of Operations Research andInd ustrial Engineering, Cornell University, Ithaca, NY, September 1999. 705","DOI":"10.1080\/10556789908805762"},{"key":"48_CR29","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L. Vandenberghe","year":"1996","unstructured":"L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 38:49\u201395, 1996. 705","journal-title":"SIAM Review"},{"key":"48_CR30","unstructured":"L. Vandenberghe and S. Boyd. SP Software for semidefinite programming User\u2019s guide, version 1.0. Technical report, Information System Laboratory, Stanford University, Stanford, CA, November 1998. 705"},{"key":"48_CR31","unstructured":"C. Walshaw, M. Cross, and M. Everett. Mesh partitioning and load-balancing for distributed memory parallel systems. In B. Topping, editor, Proc. Parallel & Distributed Computing for Computational Mechanics, Lochinver, Scotland, 1998. 705"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing for Computational Science \u2014 VECPAR 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36569-9_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T18:50:37Z","timestamp":1558983037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36569-9_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008521","9783540365693"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-36569-9_48","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}