暂无分享,去创建一个
[1] R. Ambartzumian. Stochastic and integral geometry , 1987 .
[2] Noriyoshi Sukegawa. An Asymptotically Improved Upper Bound on the Diameter of Polyhedra , 2019, Discret. Comput. Geom..
[3] Svante Janson,et al. Large deviations for sums of partly dependent random variables , 2004, Random Struct. Algorithms.
[4] Miklós Simonovits,et al. Deterministic and randomized polynomial-time approximation of radii , 2001 .
[5] Francisco Santos,et al. A counterexample to the Hirsch conjecture , 2010, ArXiv.
[6] Daniel Dadush,et al. On the Shadow Simplex Method for Curved Polyhedra , 2015, Symposium on Computational Geometry.
[7] Antonio Sassano,et al. The Hirsch Conjecture for the fractional stable set polytope , 2014, Math. Program..
[8] Shang-Hua Teng,et al. Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.
[9] K. Borgwardt. The Simplex Method: A Probabilistic Analysis , 1986 .
[10] K. Borgwardt. A Sharp Upper Bound for the Expected Number of Shadow Vertices in Lp-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes , 1999 .
[11] Denis Naddef,et al. The hirsch conjecture is true for (0, 1)-polytopes , 1989, Mathematical programming.
[12] Rabi Bhattacharya,et al. A basic course in probability theory , 2007 .
[13] Leen Stougie,et al. A Linear Bound On The Diameter Of The Transportation Polytope* , 2006, Comb..
[14] Nikhil Srivastava,et al. A Spectral Approach to Polytope Diameter , 2022, ITCS.
[15] Petra Huhn,et al. A lower bound on the average number of Pivot-steps for solving linear programs Valid for all variants of the Simplex-Algorithm , 1999, Math. Methods Oper. Res..
[16] Martin E. Dyer,et al. Random walks, totally unimodular matrices, and a randomised dual simplex algorithm , 1994, IPCO.
[17] Daniel Dadush,et al. A friendly smoothed analysis of the simplex method , 2017, STOC.
[18] David W. Barnette. An upper bound for the diameter of a polytope , 1974, Discret. Math..
[19] Francisco Santos,et al. Hirsch polytopes with exponentially long combinatorial segments , 2015, Math. Program..
[20] Roman Vershynin,et al. Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[21] D. Larman. Paths on Polytopes , 1970 .
[22] Zoltán Füredi,et al. On the shape of the convex hull of random points , 1988 .
[23] Laura Sanità,et al. The Diameter of the Fractional Matching Polytope and Its Hardness Implications , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[24] Richard C. Grinold. The Hirsch Conjecture in Leontief Substitution Systems , 1971 .
[25] Alberto Del Pia,et al. On the Diameter of Lattice Polytopes , 2015, Discrete & Computational Geometry.
[26] Alexander A. Razborov,et al. Diameter of polyhedra: limits of abstraction , 2009, SCG '09.
[27] Antoine Deza,et al. Improved bounds on the diameter of lattice polytopes , 2016 .
[28] D. Barnette,et al. Wv paths on 3-polytopes , 1969 .
[29] Peter Kleinschmidt,et al. On the diameter of convex polytopes , 1992, Discret. Math..
[30] Sylvain Lazard,et al. Silhouette of a random polytope , 2016, J. Comput. Geom..
[31] Friedrich Eisenbrand,et al. On Sub-determinants and the Diameter of Polyhedra , 2011, SoCG '12.
[32] Jesús A. De Loera,et al. The diameters of network-flow polytopes satisfy the Hirsch conjecture , 2018, Math. Program..
[33] M. L. Balinski,et al. The Hirsch Conjecture for Dual Transportation Polyhedra , 1984, Math. Oper. Res..
[34] Michael J. Todd,et al. An Improved Kalai-Kleitman Bound for the Diameter of a Polyhedron , 2014, SIAM J. Discret. Math..
[35] G. Kalai,et al. A quasi-polynomial bound for the diameter of graphs of polyhedra , 1992, math/9204233.
[36] E. Saff,et al. The Covering Radius of Randomly Distributed Points on a Manifold , 2015, 1504.03029.