{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T13:55:52Z","timestamp":1765806952623},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407706"},{"type":"electronic","value":"9783540451983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_27","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T03:32:30Z","timestamp":1294457550000},"page":"318-328","source":"Crossref","is-referenced-by-count":7,"title":["On the Graph-Density of Random 0\/1-Polytopes"],"prefix":"10.1007","author":[{"given":"Volker","family":"Kaibel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anja","family":"Remshagen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F. Barahona","year":"1986","unstructured":"Barahona, F., Mahjoub, A.R.: On the cut polytope. Math. Program.\u00a036, 157\u2013173 (1986)","journal-title":"Math. Program."},{"issue":"1","key":"27_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1002\/rsa.3240030107","volume":"3","author":"M.E. Dyer","year":"1992","unstructured":"Dyer, M.E., F\u00fcredi, Z., McDiarmid, C.: Volumes spanned by random points in the hypercube. Random Structures Algorithms\u00a03(1), 91\u2013106 (1992)","journal-title":"Random Structures Algorithms"},{"key":"27_CR3","first-page":"26","volume-title":"Proceedings of the 24th Annual ACM Symposium on the theory of Computing (STOC)","author":"T. Feder","year":"1992","unstructured":"Feder, T., Mihail, M.: Balanced matroids. In: Proceedings of the 24th Annual ACM Symposium on the theory of Computing (STOC), Victoria, British Columbia, pp. 26\u201338. ACM Press, New York (1992)"},{"issue":"4","key":"27_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF02187704","volume":"1","author":"Z. F\u00fcredi","year":"1986","unstructured":"F\u00fcredi, Z.: Random polytopes in the d-dimensional cube. Discrete Comput. Geom.\u00a01(4), 315\u2013319 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"27_CR5","unstructured":"Jerrum, M., Sinclair, A.: The Markov chain Monte Carlo method. In: Hochbaum, D. (ed.) Approximation Algorithms, pp. 482\u2013520, PWS (1997)"},{"issue":"1","key":"27_CR6","first-page":"223","volume":"8","author":"J. Kahn","year":"1995","unstructured":"Kahn, J., Koml\u00f3s, J., Szemer\u00e9di, E.: On the probability that a random \u00b11- matrix is singular. J. Amer. Math. Soc.\u00a08(1), 223\u2013240 (1995)","journal-title":"J. Amer. Math. Soc."},{"key":"#cr-split#-27_CR7.1","unstructured":"Kaibel, V.: On the expansion of graphs of 0\/1-polytopes. Technical report, TU Berlin (2001);"},{"key":"#cr-split#-27_CR7.2","unstructured":"To appear in: The Sharpest Cut. M. Gr\u00f6tschel (ed.), SIAM (2003)"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01589099","volume":"45","author":"D.J. Naddef","year":"1989","unstructured":"Naddef, D.J.: The Hirsch conjecture is true for (0,1)-polytopes. Math. Program., Ser. B\u00a045(1), 109\u2013110 (1989)","journal-title":"Math. Program., Ser. B"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0095-8956(84)90043-1","volume":"37","author":"D.J. Naddef","year":"1984","unstructured":"Naddef, D.J., Pulleyblank, W.R.: Hamiltonicity in (0-1)-polyhedra. J. Comb. Theory, Ser. B\u00a037, 41\u201352 (1984)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"27_CR10","series-title":"Algorithms and Combinatorics","volume-title":"Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. In: Polyhedra and Efficiency. Algorithms and Combinatorics, vol.\u00a0A\u2013C(24), Springer, Berlin (2003)"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1137\/0114068","volume":"14","author":"R.O. Winder","year":"1966","unstructured":"Winder, R.O.: Partitions of N-space by hyperplanes. SIAM J. Appl. Math.\u00a014, 811\u2013818 (1966)","journal-title":"SIAM J. Appl. Math."},{"key":"#cr-split#-27_CR12.1","doi-asserted-by":"crossref","unstructured":"Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol.\u00a0152. Springer-Verlag, New York (1995);","DOI":"10.1007\/978-1-4613-8431-1"},{"key":"#cr-split#-27_CR12.2","unstructured":"Revised edition: 1998"},{"key":"27_CR13","series-title":"DMV Sem.","first-page":"1","volume-title":"Polytopes\u2014Combinatorics and Computation","author":"G.M. Ziegler","year":"2000","unstructured":"Ziegler, G.M.: Lectures on 0\/1-polytopes. In: Polytopes\u2014Combinatorics and Computation. DMV Sem. vol.\u00a029, pp. 1\u201341. Birkh\u00e4user, Basel (2000)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45198-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T15:18:38Z","timestamp":1553354318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}