Random walks in polytopes and negative dependence
From MaRDI portal
Recommendations
- Random walks on polytopes and an affine interior point method for linear programming
- Random walks on polytopes of constant corank
- Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
- Random walks on polytopes and an affine interior point method for linear programming
- scientific article; zbMATH DE number 2079356
Cites work
- A Randomized Rounding Approach to the Traveling Salesman Problem
- A central limit theorem for random fields of negatively associated processes
- An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
- Balls and bins: A study in negative dependence
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Concentration of Measure for the Analysis of Randomized Algorithms
- Constructive discrepancy minimization by walking on the edges
- Dependent rounding and its applications to approximation algorithms
- Entropy, optimization and counting
- Iterative methods in combinatorial optimization.
- Limit theorems for negatively dependent random variables.
- Multi-budgeted matchings and matroid intersection via dependent rounding
- Negative association of random variables, with applications
- Negative dependence and the geometry of polynomials
- Negative dependence in sampling
- On the half-plane property and the Tutte group of a matroid
- Towards a theory of negative dependence.
Cited in
(3)
This page was built for publication: Random walks in polytopes and negative dependence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4638105)
