{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T08:00:37Z","timestamp":1751097637884},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261995"},{"type":"electronic","value":"9783540321026"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496915_17","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T16:40:39Z","timestamp":1279125639000},"page":"225-235","source":"Crossref","is-referenced-by-count":7,"title":["Jumping Doesn\u2019t Help in Abstract Cubes"],"prefix":"10.1007","author":[{"given":"Ingo","family":"Schurr","sequence":"first","affiliation":[]},{"given":"Tibor","family":"Szab\u00f3","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/BFb0121238","volume":"1","author":"I. Adler","year":"1974","unstructured":"Adler, I., Dantzig, G.B.: Maximum diameter of abstract polytopes. Math. Programming Studies\u00a01, 20\u201340 (1974)","journal-title":"Math. Programming Studies"},{"key":"17_CR2","first-page":"89","volume":"1","author":"L. Adler","year":"1976","unstructured":"Adler, L., Saigal, R.: Long monotone paths in abstract polytopes. Math.\u00a0Oper.\u00a0Res.\u00a01, 89\u201395 (1976)","journal-title":"Math.\u00a0Oper.\u00a0Res."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Amenta, N., Ziegler, G.M.: Shadows and slices of polytopes. In: Proc. 12th Annu. ACM Sympos. Comput. Geom., pp. 10\u201319 (1996)","DOI":"10.1145\/237218.237228"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/PL00009827","volume":"18","author":"B. G\u00e4rtner","year":"1998","unstructured":"G\u00e4rtner, B., Henk, M., Ziegler, G.M.: Randomized simplex algorithms on Klee-Minty cubes. Combinatorica\u00a018(3), 349\u2013372 (1998)","journal-title":"Combinatorica"},{"key":"17_CR5","unstructured":"G\u00e4rtner, B., Schurr, I.: Linear Programming and Geometric Unique Sink Orientations. Manuscript in preparation (2004)"},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-94-015-8330-5_2","volume-title":"Advances in optimization and numerical analysis","author":"D. Goldfarb","year":"1994","unstructured":"Goldfarb, D.: On the complexity of the simplex algorithm. In: Advances in optimization and numerical analysis, pp. 25\u201338. Kluwer, Dordrecht (1994)"},{"key":"17_CR7","unstructured":"Kaibel, V.: The La Claustra lecture"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0097-3165(88)90064-7","volume":"49","author":"G. Kalai","year":"1988","unstructured":"Kalai, G.: A simple way to tell a simple polytope from its graph. J. Combin. Theory, Ser. A\u00a049(2), 381\u2013383 (1988)","journal-title":"J. Combin. Theory, Ser. A"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Kalai, G.: A subexponential randomized simplex algorithm. In: Proc. 24th Annu. ACM Sympos. Theory Comput., pp. 475\u2013482 (1992)","DOI":"10.1145\/129712.129759"},{"key":"17_CR10","first-page":"159","volume-title":"Inequalities III","author":"V. Klee","year":"1972","unstructured":"Klee, V., Minty, G.J.: How good is the simplex algorithm? In: Shisha, O. (ed.) Inequalities III, pp. 159\u2013175. Academic Press, London (1972)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/BF01940877","volume":"16","author":"J. Matou\u0161ek","year":"1996","unstructured":"Matou\u0161ek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica\u00a016, 498\u2013516 (1996)","journal-title":"Algorithmica"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s101070100268","volume":"Ser. A 92","author":"W.D. Morris","year":"2002","unstructured":"Morris, W.D.: Randomized principal pivot algorithms for P-matrix linear complementarity problems. Mathematical Programming\u00a0Ser. A 92, 285\u2013296 (2002)","journal-title":"Mathematical Programming"},{"key":"#cr-split#-17_CR13.1","unstructured":"Schurr, I., Szab??, T.: Finding the sink takes some time, Discrete and Computational Geometry (to appear);"},{"key":"#cr-split#-17_CR13.2","unstructured":"An extended abstract appeared in the proceedings of the European Symposium on Algorithms, ESA (2002)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Szab\u00f3, T., Welzl, E.: Unique sink orientations of cubes. In: Proc. 42nd IEEE Symp. on Foundations of Comput. Sci., pp. 547\u2013555 (2001)","DOI":"10.1109\/SFCS.2001.959931"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0166-218X(88)90042-X","volume":"20","author":"K. Williamson Hoke","year":"1988","unstructured":"Williamson Hoke, K.: Completely unimodal numberings of a simple polytope. Discrete Appl. Math.\u00a020, 69\u201381 (1988)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496915_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:00:29Z","timestamp":1605643229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496915_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261995","9783540321026"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11496915_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}