The Complexity of the Simplex Method
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 11986
- Type
- E - Conference contribution
- DOI
-
10.1145/2746539.2746558
- Title of conference / published proceedings
- STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing
- First page
- 201
- Volume
- 14-17-June-2015
- Issue
- -
- ISSN
- 0737-8017
- Open access status
- Out of scope for open access requirements
- Month of publication
- June
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper solves the main open problems in "On Simplex Pivoting Rules and Complexity Theory" by Adler, Papadimitriou, and Rubinstein (IPCO 2014) and "The Simplex Algorithm is NP-mighty" by Disser and Skutella (SODA 2015). The paper appeared at the ACM Symposium on Theory of Computing (STOC) in 2015, after featuring in David Eppstein's list of ten highlights in algorithms preprints in 2014, see https://11011110.github.io/blog/2015/01/01/2014-in-algorithm.html.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -