( en | de | ru )

 

Disambiguation of "Rothvoß, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
Diameter of Polyhedra: Limits of Abstraction.

, , , and . Math. Oper. Res., 35 (4): 786-794 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Karl Rothvoss

Thomas Thomas

Thomas Harasim

Die Rolle des nucleostemin-Gens in dem Prozess der Ribosomenbiogenese. Uni München, (2009)

Thomas Baron

Untersuchungen an ungeschädigten und durch Pilzbefall geschädigten Nadelholzbauteilen mit ausgewählten Prüfverfahren. TU Dresden, (2009)

Thomas Böttcher

Naturstoffe und ihre Derivate als molekulare Sonden: Identifikation ihrer Angriffsziele und Inhibition der Virulenz in pathogenen Bakterien. Uni München, (2009)
 

Other publications of authors with the same name

Diameter of polyhedra: limits of abstraction., , and . SCG, page 386-392. ACM, (2009)The entropy rounding method in approximation algorithms.. SODA, page 356-372. SIAM, (2012)Approximating Bin Packing within O(log OPT * Log Log OPT) Bins.. FOCS, page 20-29. IEEE Computer Society, (2013)A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation., and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 246-257. Springer, (2008)Pricing on Paths: A PTAS for the Highway Problem., and . SODA, page 675-684. SIAM, (2011)Constructive Discrepancy Minimization for Convex Sets.. FOCS, page 140-145. IEEE Computer Society, (2014)Network Design via Core Detouring for Problems without a Core., and . ICALP (1), volume 6198 of Lecture Notes in Computer Science, page 490-502. Springer, (2010)Diameter of Polyhedra: Limits of Abstraction., , , and . Flexible Network Design, volume 10211 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)Improved Analysis of Online Balanced Clustering., , , , , and . WAOA, volume 12982 of Lecture Notes in Computer Science, page 224-233. Springer, (2021)Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard., and . RTSS, page 397-406. IEEE Computer Society, (2008)