- in time
polynomial in n (the
polynomial has a high degree, at
least 8).
Rothvoss presented an
algorithm that
generates a
solution with at most O P T + O...
- {\displaystyle n^{n}\cdot 2^{O(n)}\cdot (m\cdot \log V)^{O(1)}} . Reis and
Rothvoss presented an
improved algorithm with run-time ( log n ) O ( n ) ⋅ ( m...
- (2): 17:1–17:23. arXiv:1111.0837. doi:10.1145/2716307. S2CID 7372000.
Rothvoss,
Thomas (2017). "The
Matching Polytope has
Exponential Extension Complexity"...
-
their algorithm finds an
optimal solution in time O(log V).
Goemans and
Rothvoss presented an
algorithm for any
fixed d, that
finds the
optimal solution...
- 1145/1250790.1250801. ISBN 978-1-59593-631-8. Byrka, J.; Grandoni, F.;
Rothvoß, T.; Sanita, L. (2010). "An
improved LP-based
approximation for Steiner...
- Allen, and
Julia Böttcher for The
chromatic thresholds of
graphs Thomas Rothvoss for his work on the
extension complexity of the
matching polytope. 2021:...
- 193–205, doi:10.1287/moor.26.2.193.10561, MR 1895823 Fiorini, Samuel;
Rothvoß, Thomas; Tiwary, Hans Raj (2012), "Extended
formulations for polygons"...
-
condition is used in the LLL reduction. https://sites.math.washington.edu/~
rothvoss/lecturenotes/IntOpt-and-Lattices.pdf, pp. 18-19
Zhang et al 2012, p.1 Yasuda...
-
Knuth Prize Lecture Prabhakar Raghavan (2013),
Plenary talk 2014
Thomas Rothvoss (2014), "The
matching polytope has
exponential extension complexity" Shafi...
-
techniques were
improved later, to
provide even
better approximations.
Rothvoss uses the same
scheme as
Algorithm 2, but with a
different rounding procedure...
