Random walks, totally unimodular matrices, and a randomised dual simplex algorithm (Q1330890): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): journals/mp/DyerF94, #quickstatements; #temporary_batch_1735573089131
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q228771 / rank
Normal rank
 
Property / author
 
Property / author: Alan M. Frieze / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56324072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3876608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Properties of the Network Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random polynomial-time algorithm for approximating the volume of convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763400 / 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: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting, uniform generation and rapidly mixing Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two combinatorial applications of the Aleksandrov-Fenchel inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bad network problem for the simplex method and other minimum cost flow algorithms / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mp/DyerF94 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:39, 30 December 2024

scientific article
Language Label Description Also known as
English
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
scientific article

    Statements

    Identifiers