STOC 2021
A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path
Abstract
No abstract is available in the live database for this paper.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- ACM Symposium on Theory of Computing
- Archive span
- 1969-2025
- Indexed papers
- 4364
- Paper id
- 800233025516272897