{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:10:46Z","timestamp":1725567046765},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_3","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:34:13Z","timestamp":1127813653000},"page":"10-11","source":"Crossref","is-referenced-by-count":1,"title":["Smoothed Analysis of Algorithms and Heuristics"],"prefix":"10.1007","author":[{"given":"Shang-Hua","family":"Teng","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/990308.990310","volume":"51","author":"D.A. Spielman","year":"2004","unstructured":"Spielman, D.A., Teng, S.-H.: Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of ACM\u00a051(3), 385\u2013463 (2004)","journal-title":"Journal of ACM"},{"key":"3_CR2","first-page":"275","volume":"97","author":"D.A. Spielman","year":"2004","unstructured":"Spielman, D.A., Teng, S.-H.: Smoothed Analysis of Termination of Linear Programming Algorithms. Mathematical Programming, Series B\u00a097, 275\u2013404 (2004)","journal-title":"Mathematical Programming, Series B"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/11533719_3","volume-title":"Computing and Combinatorics","author":"A. Sankar","year":"2005","unstructured":"Sankar, A., Spielman, D.A., Teng, S.-H.: Smoothed Analysis of Condition Numbers and Growth Factors of Matrices, SIMAX. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 10\u201311. Springer, Heidelberg (2005)"},{"key":"3_CR4","unstructured":"Duangan, J., Spielman, D.A., Teng, S.-H.: Smoothed Analysis of Condition Numbers and Complexity Implications for Linear Programming. Mathematical Programming, Series A (2005) (to appear)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Beier, R., V\u00f6cking, B.: Typical properties of winners and losers in discrete optimization. In: ACM STOC, pp. 343\u2013352 (2004)","DOI":"10.1145\/1007352.1007409"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., Schafer, G., Vredeveld, T.: Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. In: IEEE FOCS, pp. 462\u2013471 (2003)","DOI":"10.1109\/SFCS.2003.1238219"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T22:52:12Z","timestamp":1553554332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11533719_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}