Results 1  10
of
311
The random facet simplex algorithm on combinatorial cubes
 Random Structures & Algorithms
, 2001
"... ..."
An improved version of the RandomFacet pivoting rule for the simplex algorithm
, 2015
"... The RandomFacet pivoting rule of Kalai and of Matoušek, Sharir and Welzl is an elegant randomized pivoting rule for the simplex algorithm, the classical combinatorial algorithm for solving linear programs (LPs). The expected number of pivoting steps performed by the simplex algorithm when using th ..."
Abstract
 Add to MetaCart
The RandomFacet pivoting rule of Kalai and of Matoušek, Sharir and Welzl is an elegant randomized pivoting rule for the simplex algorithm, the classical combinatorial algorithm for solving linear programs (LPs). The expected number of pivoting steps performed by the simplex algorithm when using
Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games
, 2014
"... In [Friedmann, Hansen, and Zwick (2011)] and we claimed that the expected number of pivoting steps performed by the RandomFacet algorithm of Kalai and of Matoušek, Sharir, and Welzl is equal to the expected number of pivoting steps performed by RandomFacet∗, a variant of RandomFacet that bases i ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In [Friedmann, Hansen, and Zwick (2011)] and we claimed that the expected number of pivoting steps performed by the RandomFacet algorithm of Kalai and of Matoušek, Sharir, and Welzl is equal to the expected number of pivoting steps performed by RandomFacet∗, a variant of RandomFacet that bases
A subexponential lower bound for the Random Facet algorithm for Parity Games
"... Parity Games form an intriguing family of infinite duration games whose solution is equivalent to the solution of important problems in automatic verification and automata theory. They also form a very natural subclass of Deterministic Mean Payoff Games, which in turn is a very natural subclass of t ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
Matouˇsek, Sharir and Welzl as the Random Facet algorithm. The expected running time of these algorithmsis subexponential in the size of the game, i.e., 2
A Discourse on the Pivot Rules RANDOM EDGE and RANDOM FACET
, 2000
"... This technical report is a summary of most of the topics I was working on during my first year at the ETH. Hopefully, I hope to expand on some of them during my dissertation. It is, therefore, to be regarded as work in progress. The largest section is about finding new nontrivial bounds for Random E ..."
Abstract
 Add to MetaCart
] whose LP instances, as shown by Gartner [1], can be solved by Random Facet in polynomial time while some of its nonLP instances are proof that the subexponential bounds are tight. We studied how Random Edge is doing on the Matousek examples, and claim now the following: In dimension d
The Quickhull algorithm for convex hulls
 ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
, 1996
"... The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practical convex hull algorithm that combines the twodimensional Quickhull Algorithm with the generaldimension BeneathBeyond Algorithm. It is similar to the randomized, incremental algo ..."
Abstract

Cited by 713 (0 self)
 Add to MetaCart
The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practical convex hull algorithm that combines the twodimensional Quickhull Algorithm with the generaldimension BeneathBeyond Algorithm. It is similar to the randomized, incremental
Random Walks in PeertoPeer Networks
, 2004
"... We quantify the effectiveness of random walks for searching and construction of unstructured peertopeer (P2P) networks. For searching, we argue that random walks achieve improvement over flooding in the case of clustered overlay topologies and in the case of reissuing the same request several tim ..."
Abstract

Cited by 226 (3 self)
 Add to MetaCart
in complexity theory for construction of pseudorandom number generators. We reveal another facet of this theory and translate savings in random bits to savings in processing overhead.
Randomized Trial of Radiofrequency Lumbar Facet
"... Study Design. A prospective doubleblind randomized trial in 31 patients. Objectives. To assess the clinical efficacy of percutaneous radiofrequency denervation of the lumbar zygapophysial joints in reducing pain, functional disability, and physical impairment in patients with back pain originati ..."
Abstract
 Add to MetaCart
Study Design. A prospective doubleblind randomized trial in 31 patients. Objectives. To assess the clinical efficacy of percutaneous radiofrequency denervation of the lumbar zygapophysial joints in reducing pain, functional disability, and physical impairment in patients with back pain orig
A Subexponential Bound for Linear Programming
 ALGORITHMICA
, 1996
"... We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected min{O(d 2 2 d n),e 2 d ln(n / d)+O ( d+ln n)} time in the unit cost model (where we count the number of arithmetic operations on the numbers in the input); to be precise, the algorith ..."
Abstract

Cited by 185 (15 self)
 Add to MetaCart
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected min{O(d 2 2 d n),e 2 d ln(n / d)+O ( d+ln n)} time in the unit cost model (where we count the number of arithmetic operations on the numbers in the input); to be precise
Results 1  10
of
311