{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:21Z","timestamp":1725559161356},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_8","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"65-76","source":"Crossref","is-referenced-by-count":1,"title":["Multicriteria Global Minimum Cuts"],"prefix":"10.1007","author":[{"given":"Amitai","family":"Armon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uri","family":"Zwick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Bruglieri, M., Ehrgott, M., Hamacher, H.W.: Some complexity results for k-cardinality minimum cut problems. Technical Report 69\/2000, Wirtschaftsmathematik, University of Kaiserslautern (2000)"},{"issue":"3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0166-218X(03)00358-5","volume":"137","author":"M. Bruglieri","year":"2004","unstructured":"Bruglieri, M., Maffioli, F., Ehrgott, M.: Cardinality constrained minimum cut problems: Complexity and algorithms. Discrete Applied Mathematics\u00a0137(3), 311\u2013341 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-60667-0","volume-title":"Multicriteria Analysis","author":"J. Climacao","year":"1997","unstructured":"Climacao, J.: Multicriteria Analysis. Springer, Heidelberg (1997)"},{"key":"8_CR4","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22199-0","volume-title":"Multicriteria optimization","author":"M. Ehrgott","year":"2000","unstructured":"Ehrgott, M.: Multicriteria optimization. Lecture Notes in Economics and Mathematical Systems. Springer, Heidelberg (2000)"},{"key":"8_CR5","volume-title":"Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"issue":"4","key":"8_CR6","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multiterminal network flows. Journal of the Society for Industrial and Applied Mathematics\u00a09(4), 551\u2013570 (1961)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-642-48782-8_9","volume-title":"Multiple Criteria Decision Making: Theory and Applications, LNEMS 177","author":"P. Hansen","year":"1980","unstructured":"Hansen, P.: Bicriterion path problems. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making: Theory and Applications, LNEMS 177, pp. 109\u2013127. Springer, Berlin (1980)"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.orl.2003.06.003","volume":"32","author":"S.P. Hong","year":"2004","unstructured":"Hong, S.P., Chung, S.J., Park, B.H.: A fully-polynomial bicriteria approximation scheme for the constrained minimum spanning tree problem. Operations Research Letters\u00a032(3), 233\u2013239 (2004)","journal-title":"Operations Research Letters"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E. Horowitz","year":"1976","unstructured":"Horowitz, E., Sahni, S.: Exact and approximate algorithms for scheduling non-identical processors. Journal of the ACM\u00a023, 317\u2013327 (1976)","journal-title":"Journal of the ACM"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Jansen, K., Porkolab, L.: Improved approximation schemes for scheduling unrelated parallel machines. In: Proceedings of the thirty-first annual ACM Symposium on Theory of Computing, pp. 408\u2013417 (1999)","DOI":"10.1145\/301250.301361"},{"issue":"2","key":"8_CR11","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1287\/moor.24.2.383","volume":"24","author":"D.R. Karger","year":"1999","unstructured":"Karger, D.R.: Random sampling in cut, flow, and network design problems. Mathematics of Operations Research\u00a024(2), 383\u2013413 (1999)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/331605.331608","volume":"47","author":"D.R. Karger","year":"2000","unstructured":"Karger, D.R.: Minimum cuts in near-linear time. Journal of the ACM\u00a047(1), 46\u201376 (2000)","journal-title":"Journal of the ACM"},{"issue":"4","key":"8_CR13","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"D.R. Karger","year":"1996","unstructured":"Karger, D.R., Stein, C.: A new approach to the minimum cut problem. Journal of the ACM\u00a043(4), 601\u2013640 (1996)","journal-title":"Journal of the ACM"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming\u00a046, 259\u2013271 (1990)","journal-title":"Mathematical Programming"},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/0405004","volume":"5","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: Computing edge-connectivity in multigraphs and capacitated graphs. SIAM Journal on Discrete Mathematics\u00a05(1), 54\u201366 (1992)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1137\/S0895480194271323","volume":"10","author":"H. Nagamochi","year":"1997","unstructured":"Nagamochi, H., Nishimura, K., Ibaraki, T.: Computing all small cuts in an undirected network. SIAM J. Discrete Mathematics\u00a010(3), 469\u2013481 (1997)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: IEEE Symposium on Foundations of Computer Science, pp. 86\u201392 (2000)","DOI":"10.1109\/SFCS.2000.892068"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Schloegel, K., Karypis, G., Kumar, V.: A new algorithm for multi-objective graph partitioning. In: European Conference on Parallel Processing, pp. 322\u2013331 (1999)","DOI":"10.1007\/3-540-48311-X_42"},{"issue":"4","key":"8_CR19","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M. Stoer","year":"1997","unstructured":"Stoer, M., Wagner, F.: A simple min-cut algorithm. Journal of the ACM\u00a044(4), 585\u2013591 (1997)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:29:43Z","timestamp":1620012583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}