{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:01:39Z","timestamp":1726408899304},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079554"},{"type":"electronic","value":"9783319079561"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07956-1_12","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T12:47:17Z","timestamp":1402404437000},"page":"124-136","source":"Crossref","is-referenced-by-count":0,"title":["Finding Robust Minimum Cuts"],"prefix":"10.1007","author":[{"given":"Barbara","family":"Geissmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rastislav","family":"\u0160r\u00e1mek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","first-page":"505","volume-title":"Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, ITCS 2013","author":"J.M. Buhmann","year":"2013","unstructured":"Buhmann, J.M., Mihal\u00e1k, M., \u0160r\u00e1mek, R., Widmayer, P.: Robust optimization in the presence of uncertainty. In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, ITCS 2013, pp. 505\u2013514. ACM, New York (2013)"},{"doi-asserted-by":"crossref","unstructured":"Botafogo, R.A.: Cluster Analysis for Hypertext Systems. In: Proceedings of the 16th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 116\u2013125. ACM (1993)","key":"12_CR2","DOI":"10.1145\/160688.160704"},{"issue":"9","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"26","author":"Y. Boykov","year":"2004","unstructured":"Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut\/max- flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a026(9), 1124\u20131137 (2004)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF02592076","volume":"39","author":"A. Ramanathan","year":"1987","unstructured":"Ramanathan, A., Colbourn, C.J.: Counting almost minimum cutsets with reliability applications. Mathematical Programming\u00a039(3), 253\u2013261 (1987)","journal-title":"Mathematical Programming"},{"unstructured":"Schneider, J.J., Kirkpatrick, S.: Stochastic Optimization. Springer (2007)","key":"12_CR5"},{"unstructured":"Kall, P., Mayer, J.: Stochastic Linear Programming: Models, Theory, and Computation. Springer (2005)","key":"12_CR6"},{"doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton Series in Applied Mathematics. Princeton University Press (October 2009)","key":"12_CR7","DOI":"10.1515\/9781400831050"},{"unstructured":"Bilu, Y., Linial, N.: Are stable instances easy? In: Proceedings of the First Symposium on Innovations in Computer Science (ICS), pp. 332\u2013341 (2010)","key":"12_CR8"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-69903-3_24","volume-title":"Algorithm Theory \u2013 SWAT 2008","author":"D. Bil\u00f2","year":"2008","unstructured":"Bil\u00f2, D., B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Kr\u00e1lovi\u010d, R., M\u00f6mke, T., Widmayer, P., Zych, A.: Reoptimization of steiner trees. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol.\u00a05124, pp. 258\u2013269. Springer, Heidelberg (2008)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-642-18381-2_32","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"M. Mihal\u00e1k","year":"2011","unstructured":"Mihal\u00e1k, M., Sch\u00f6ngens, M., \u0160r\u00e1mek, R., Widmayer, P.: On the complexity of the metric TSP under stability considerations. In: \u010cern\u00e1, I., Gyim\u00f3thy, T., Hromkovi\u010d, J., Jefferey, K., Kr\u00e1lovi\u0107, R., Vukoli\u0107, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol.\u00a06543, pp. 382\u2013393. Springer, Heidelberg (2011)"},{"unstructured":"Mihal\u00e1k, M., \u0160r\u00e1mek, R.: Counting approximately-shortest paths in directed acyclic graphs (2013), \n                    \n                      http:\/\/arxiv.org\/abs\/1304.6707","key":"12_CR11"},{"unstructured":"Dinits, E.A., Karzanov, A.V., Lomonosov, V.: On the Structure of a Family of Minimal Weighted Cuts in a Graph (1976)","key":"12_CR12"},{"unstructured":"Karger, D.R.: Global min-cuts in RNC, and other ramifications of a simple min-out algorithm. In: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 21\u201330 (1993)","key":"12_CR13"},{"issue":"4","key":"12_CR14","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"J. Scott Provan","year":"1983","unstructured":"Scott Provan, J., Ball, M.O.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM Journal on Computing\u00a012(4), 777\u2013788 (1983)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"12_CR15","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 Journal on Discrete Mathematics\u00a010(3), 469\u2013481 (1997)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"4","key":"12_CR16","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"},{"unstructured":"Geissmann, B.: Approximation set optimization for minimum cut (August 2012), \n                    \n                      http:\/\/www.100acrewood.org\/~rasto\/publications\/ThesisBarbaraGeissmann.pdf","key":"12_CR17"},{"unstructured":"Market rates online (August 2012), \n                    \n                      http:\/\/www.marketratesonline.com","key":"12_CR18"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07956-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:38:47Z","timestamp":1558906727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07956-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079554","9783319079561"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07956-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}