Thomas Rothvoß

发表

A simpler proof for O(congestion + dilation) packet routing pdf

Thomas Rothvoß, 2012, ArXiv.

Bin packing via discrepancy of permutations

Friedrich Eisenbrand, Thomas Rothvoß, Dömötör Pálvölgyi, 2010, SODA '11.

EDF-schedulability of synchronous periodic task systems is coNP-hard

Friedrich Eisenbrand, Thomas Rothvoß, F. Eisenbrand, 2010, SODA '10.

Connected facility location via random facility sampling and core detouring

Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, 2010, J. Comput. Syst. Sci..

The matching polytope has exponential extension complexity

Thomas Rothvoß, T. Rothvoss, 2013, STOC.

Approximating connected facility location problems via random facility sampling and core detouring

Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, 2008, SODA '08.

Extended Formulations for Polygons

Hans Raj Tiwary, Samuel Fiorini, Thomas Rothvoß, 2011, Discret. Comput. Geom..

An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling

Thomas Rothvoß, Andreas Karrenbauer, A. Karrenbauer, 2009, ESA.

Some 0/1 polytopes need exponential size extended formulations

Thomas Rothvoß, T. Rothvoss, 2011, Math. Program..

Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets

Friedrich Eisenbrand, János Pach, Thomas Rothvoß, 2008, Electron. J. Comb..

Edge-Colouring Hypergraphs Properly (Covering with Matchings) or Polychromatically (Packing Covers) pdf

David Pritchard, Thomas Rothvoß, 2010, ArXiv.

Cover-Decomposition and Polychromatic Numbers

Béla Bollobás, David Pritchard, Thomas Rothvoß, 2010, SIAM J. Discret. Math..

0/1 Polytopes with Quadratic Chvátal Rank pdf

Laura Sanità, Thomas Rothvoß, 2017, Oper. Res..

A direct proof for Lovett's bound on the communication complexity of low rank matrices pdf

Thomas Rothvoß, 2014, ArXiv.

Approximating Bin Packing within O(log OPT * Log Log OPT) Bins

Thomas Rothvoß, T. Rothvoss, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

Diameter of polyhedra: limits of abstraction

Alexander A. Razborov, Friedrich Eisenbrand, Thomas Rothvoß, 2009, SCG '09.

Algorithmen für Virtuelle Private Netzwerke

Thomas Rothvoß, 2006 .

A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation

Friedrich Eisenbrand, Thomas Rothvoß, 2008, ICALP.

Cover-Decomposition and Polychromatic Numbers

Béla Bollobás, David Pritchard, Thomas Rothvoß, 2011, ESA.

On the Complexity of the Asymmetric VPN Problem

Laura Sanità, Thomas Rothvoß, T. Rothvoss, 2009, APPROX-RANDOM.

Algorithms for Virtual Private Networks

Thomas Rothvoß, 2006 .

From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk

Fabrizio Grandoni, Laura Sanità, Thomas Rothvoß, 2011, Math. Oper. Res..

Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard

Friedrich Eisenbrand, Thomas Rothvoß, F. Eisenbrand, 2008, 2008 Real-Time Systems Symposium.

Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms

Alan Burns, Sanjoy K. Baruah, Robert I. Davis, 2015, Real-Time Systems.

Matroids and integrality gaps for hypergraphic steiner tree relaxations

Thomas Rothvoß, Rico Zenklusen, Neil Olver, 2011, STOC '12.

Polynomiality for Bin Packing with a Constant Number of Item Types

Thomas Rothvoß, Michel X. Goemans, M. Goemans, 2013, SODA.

Network Design via Core Detouring for Problems without a Core

Fabrizio Grandoni, Thomas Rothvoß, 2010, ICALP.

The entropy rounding method in approximation algorithms pdf

Thomas Rothvoß, T. Rothvoss, 2011, SODA.

New Hardness Results for Diophantine Approximation

Friedrich Eisenbrand, Thomas Rothvoß, F. Eisenbrand, 2009, APPROX-RANDOM.

A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks

Thomas Rothvoß, Andreas Karrenbauer, A. Karrenbauer, 2010, WAOA.

An improved LP-based approximation for steiner tree

Fabrizio Grandoni, Laura Sanità, Thomas Rothvoß, 2010, STOC '10.

Pricing on paths: a PTAS for the highway problem pdf

Fabrizio Grandoni, Thomas Rothvoß, 2011, SODA '11.

Optimal Selection of Customers for a Last-Minute Offer

José R. Correa, Thomas Rothvoß, Roberto Cominetti, 2010, Oper. Res..

Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling

Alan Burns, Sanjoy K. Baruah, Robert I. Davis, 2009, Real-Time Systems.

Steiner Tree Approximation via Iterative Randomized Rounding

Fabrizio Grandoni, Laura Sanità, Thomas Rothvoß, 2013, JACM.

Constructive Discrepancy Minimization for Convex Sets

Thomas Rothvoß, T. Rothvoss, 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

0/1 Polytopes with Quadratic Chvátal Rank

Laura Sanità, Thomas Rothvoß, 2013, IPCO.

Approximation Algorithms for Single and Multi-Commodity Connected Facility Location

Fabrizio Grandoni, Thomas Rothvoß, 2011, IPCO.

A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing

Thomas Rothvoß, 2013, IPCO.

Directed Steiner Tree and the Lasserre Hierarchy pdf

Thomas Rothvoß, 2011, ArXiv.

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps pdf

Friedrich Eisenbrand, Laura Sanità, Thomas Rothvoß, 2010, IPCO.

Recent Hardness Results for Periodic Uni-processor Scheduling

Friedrich Eisenbrand, Thomas Rothvoß, 2010, Scheduling.

Improved Analysis of Online Balanced Clustering

Jirí Sgall, Thomas Rothvoß, Marcin Bienkowski, 2021, WAOA.

Bin Packing via Discrepancy of Permutations Friedrich Eisenbrand

Thomas Rothvoß, Dömötör Pálvölgyi, T. Rothvoss, 2010 .

From Uncertainty to Non-Linearity : Solving Virtual Private Network via Single-Sink Buyat-Bulk

Fabrizio Grandoni, Thomas Rothvoß, 2011 .