Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384506): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Francisco Santos / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050088862 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1307.5900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hirsch Conjecture Holds for Normal Flag Complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The classification of simplicial 3-spheres with nine vertices into polytopes and nonpolytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the diameter of a polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sub-determinants and the diameter of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: More bounds on the diameters of convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for linear systems having a binary solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulations. Structures for algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytopes and arrangements: diameter and curvature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuous \(d\)-step conjecture for polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of condition numbers and complexity implications for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple polynomial-time rescaling algorithm for solving linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks, totally unimodular matrices, and a randomised dual simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter of Polyhedra: Limits of Abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential lower bounds for randomized pivoting rules for the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some upper bounds for the diameters of convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obstructions to weak decomposability for simplicial polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branched coverings, triangulations, and 3-manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for the diameter and height of graphs of convex polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quasi-polynomial bound for the diameter\\of graphs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An update on the Hirsch conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters of Polyhedral Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths on Polyhedra. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>d</i>-Step Conjecture and Its Relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(d\)-step conjecture for polyhedra of dimension \(d<6\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diameter of convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths on Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hirsch conjecture is true for (0,1)-polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to the Hirsch conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding a pair of graphs in a surface, and the width of 4-dimensional prismatoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:18, 7 July 2024

scientific article
Language Label Description Also known as
English
Recent progress on the combinatorial diameter of polytopes and simplicial complexes
scientific article

    Statements

    Recent progress on the combinatorial diameter of polytopes and simplicial complexes (English)
    0 references
    0 references
    0 references
    28 November 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    polyhedra
    0 references
    diameter
    0 references
    Hirsch conjecture
    0 references
    simplex method
    0 references
    simplicial complex
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references