乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:40:39Z","timestamp":1725532839802},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020100"},{"type":"electronic","value":"9783642020117"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02011-7_19","type":"book-chapter","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T05:12:20Z","timestamp":1243919540000},"page":"197-208","source":"Crossref","is-referenced-by-count":4,"title":["Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow"],"prefix":"10.1007","author":[{"given":"Kevin J.","family":"Lang","sequence":"first","affiliation":[]},{"given":"Michael W.","family":"Mahoney","sequence":"additional","affiliation":[]},{"given":"Lorenzo","family":"Orecchia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0095-8956(85)90092-9","volume":"38","author":"N. Alon","year":"1985","unstructured":"Alon, N., Milman, V.: \u03bb\n 1, isoperimetric inequalities for graphs and superconcentrators. J. Combin. Theory B\u00a038, 73\u201388 (1985)","journal-title":"J. Combin. Theory B"},{"key":"19_CR2","unstructured":"Andersen, R., Lang, K.: An algorithm for improving graph partitions. In: SODA 2008: Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms, pp. 651\u2013660 (2008)"},{"key":"19_CR3","unstructured":"Arora, S., Hazan, E., Kale, S.: \n \n \n \n ${O}(\\sqrt {\\log n)}$\n approximation to sparsest cut in \n \n \n \n $\\tilde{O}(n^2)$\n time. In: FOCS 2004: Proceedings of the 45th Annual Symposium on Foundations of Computer Science, pp. 238\u2013247 (2004)"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Arora, S., Kale, S.: A combinatorial, primal-dual approach to semidefinite programs. In: STOC 2007: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp. 227\u2013236 (2007)","DOI":"10.1145\/1250790.1250823"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. In: STOC 2004: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 222\u2013231 (2004)","DOI":"10.1145\/1007352.1007355"},{"issue":"10","key":"19_CR6","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/1400181.1400204","volume":"51","author":"S. Arora","year":"2008","unstructured":"Arora, S., Rao, S., Vazirani, U.: Geometry, flows, and graph-partitioning algorithms. Communications of the ACM\u00a051(10), 96\u2013105 (2008)","journal-title":"Communications of the ACM"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Cherkassky, B., Goldberg, A., Martin, P., Setubal, J., Stolfi, J.: Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms. Journal of Experimental Algorithmics\u00a03, Article 8 (1998)","DOI":"10.1145\/297096.297140"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/PL00009180","volume":"19","author":"B. Cherkassky","year":"1997","unstructured":"Cherkassky, B., Goldberg, A.V.: On implementing push-relabel method for the maximum flow problem. Algorithmica\u00a019, 390\u2013410 (1997)","journal-title":"Algorithmica"},{"key":"19_CR9","series-title":"CBMS Regional Conference Series in Mathematics, vol.\u00a092","volume-title":"Spectral graph theory","author":"F. Chung","year":"1997","unstructured":"Chung, F.: Spectral graph theory. CBMS Regional Conference Series in Mathematics, vol.\u00a092. American Mathematical Society, Providence (1997)"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"A. Goldberg","year":"1998","unstructured":"Goldberg, A., Rao, S.: Beyond the flow decomposition barrier. Journal of the ACM\u00a045, 783\u2013797 (1998)","journal-title":"Journal of the ACM"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1137\/S0895479896312262","volume":"19","author":"S. Guattery","year":"1998","unstructured":"Guattery, S., Miller, G.: On the quality of spectral separators. SIAM Journal on Matrix Analysis and Applications\u00a019, 701\u2013719 (1998)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing\u00a020, 359\u2013392 (1998)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Khandekar, R., Rao, S., Vazirani, U.: Graph partitioning using single commodity flows. In: STOC 2006: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 385\u2013390 (2006)","DOI":"10.1145\/1132516.1132574"},{"key":"19_CR14","unstructured":"Lang, K., Rao, S.: Finding near-optimal cuts: an empirical evaluation. In: SODA 1993: Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 212\u2013221 (1993)"},{"issue":"6","key":"19_CR15","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T. Leighton","year":"1999","unstructured":"Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM\u00a046(6), 787\u2013832 (1999)","journal-title":"Journal of the ACM"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Orecchia, L., Schulman, L., Vazirani, U., Vishnoi, N.: On partitioning graphs via single commodity flows. In: STOC 2008: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 461\u2013470 (2008)","DOI":"10.1145\/1374376.1374442"},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1137\/S1064827598337373","volume":"22","author":"C. Walshaw","year":"2000","unstructured":"Walshaw, C., Cross, M.: Mesh partitioning: a multilevel balancing and refinement algorithm. SIAM Journal on Scientific Computing\u00a022(1), 63\u201380 (2000)","journal-title":"SIAM Journal on Scientific Computing"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02011-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T09:31:12Z","timestamp":1552037472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02011-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020100","9783642020117"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02011-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}