A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh

Journal title: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing

Journal publisher: ACM

Published year: 2020

Published pages: 761-774

DOI identifier: 10.1145/3357713.3384326?cid=81100084130

ISBN: 9781-450369794