Thomas Rothvoss
Thomas Rothvoss
University of Washington
Adresse e-mail validée de math.mit.edu
Titre
Citée par
Citée par
Année
An improved LP-based approximation for Steiner tree
J Byrka, F Grandoni, T Rothvoß, L Sanita
Proceedings of the forty-second ACM symposium on Theory of computing, 583-592, 2010
3122010
The matching polytope has exponential extension complexity
T Rothvoß
Journal of the ACM (JACM) 64 (6), 1-19, 2017
1992017
Steiner tree approximation via iterative randomized rounding
J Byrka, F Grandoni, T Rothvoß, L Sanità
Journal of the ACM (JACM) 60 (1), 1-33, 2013
1952013
Some 0/1 polytopes need exponential size extended formulations
T Rothvoß
Mathematical Programming 142 (1), 255-268, 2013
932013
Static-priority real-time scheduling: Response time computation is NP-hard
F Eisenbrand, T Rothvoß
2008 Real-Time Systems Symposium, 397-406, 2008
822008
EDF-schedulability of synchronous periodic task systems is coNP-hard
F Eisenbrand, T Rothvoß
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
722010
Polynomiality for bin packing with a constant number of item types
MX Goemans, T Rothvoß
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
702014
Approximating connected facility location problems via random facility sampling and core detouring
F Eisenbrand, F Grandoni, T Rothvoß, G Schäfer
Proceeding of Nineteenth annual ACM-SIAM Symposium (SODA'08), 1174-1183, 2008
612008
Extended formulations for polygons
S Fiorini, T Rothvoß, HR Tiwary
Discrete & computational geometry 48 (3), 658-668, 2012
592012
Approximating bin packing within o (log OPT* log log OPT) bins
T Rothvoß
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 20-29, 2013
572013
Connected facility location via random facility sampling and core detouring
F Eisenbrand, F Grandoni, T Rothvoß, G Schäfer
Journal of Computer and System Sciences 76 (8), 709-726, 2010
512010
Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
RI Davis, T Rothvoß, SK Baruah, A Burns
Real-Time Systems 43 (3), 211-258, 2009
482009
Constructive discrepancy minimization for convex sets
T Rothvoss
SIAM Journal on Computing 46 (1), 224-234, 2017
462017
The Lasserre hierarchy in approximation algorithms
T Rothvoß
Lecture Notes for the MAPSP, 1-25, 2013
452013
Matroids and integrality gaps for hypergraphic steiner tree relaxations
MX Goemans, N Olver, T Rothvoß, R Zenklusen
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
452012
Diameter of polyhedra: limits of abstraction
F Eisenbrand, N Hähnle, T Rothvoß
Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009
422009
Directed Steiner tree and the Lasserre hierarchy
T Rothvoß
arXiv preprint arXiv:1111.5473, 2011
362011
A logarithmic additive integrality gap for bin packing
R Hoberg, T Rothvoss
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
342017
Pricing on paths: A ptas for the highway problem
F Grandoni, T Rothvoß
SIAM Journal on Computing 45 (2), 216-231, 2016
322016
Bin packing via discrepancy of permutations
F Eisenbrand, D Pálvölgyi, T Rothvoß
ACM Transactions on Algorithms (TALG) 9 (3), 1-15, 2013
312013
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20