The following pages link to Thomas Rothvoß (Q497991):
Displaying 46 items.
- Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms (Q497994) (← links)
- Extended formulations for polygons (Q714985) (← links)
- Convexly independent subsets of the Minkowski sum of planar point sets (Q1010661) (← links)
- Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling (Q1033671) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- Improved analysis of online balanced clustering (Q2085752) (← links)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- Number balancing is as hard as Minkowski's theorem and shortest vector (Q2401164) (← links)
- An improved deterministic rescaling for linear programming algorithms (Q2401165) (← links)
- Deterministic discrepancy minimization via the multiplicative weight update method (Q2401177) (← links)
- Some \(0/1\) polytopes need exponential size extended formulations (Q2434987) (← links)
- Pricing on Paths: A PTAS for the Highway Problem (Q2796210) (← links)
- Better Bin Packing Approximations via Discrepancy Theory (Q2816297) (← links)
- An improved LP-based approximation for steiner tree (Q2875185) (← links)
- From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk (Q2884270) (← links)
- Bin Packing via Discrepancy of Permutations (Q2933654) (← links)
- Constructive Discrepancy Minimization for Convex Sets (Q2968153) (← links)
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps (Q3009761) (← links)
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767) (← links)
- A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks (Q3075459) (← links)
- Optimal Selection of Customers for a Last-Minute Offer (Q3098282) (← links)
- Diameter of Polyhedra: Limits of Abstraction (Q3169119) (← links)
- A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation (Q3521924) (← links)
- (Q3579459) (← links)
- Network Design via Core Detouring for Problems without a Core (Q3587402) (← links)
- New Hardness Results for Diophantine Approximation (Q3638871) (← links)
- On the Complexity of the Asymmetric VPN Problem (Q3638888) (← links)
- An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling (Q3639265) (← links)
- A Logarithmic Additive Integrality Gap for Bin Packing (Q4575921) (← links)
- The Matching Polytope has Exponential Extension Complexity (Q4640350) (← links)
- A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing (Q4910828) (← links)
- 0/1 Polytopes with Quadratic Chvátal Rank (Q4911536) (← links)
- Polynomiality for Bin Packing with a Constant Number of Item Types (Q5056451) (← links)
- Linear Size Sparsifier and the Geometry of the Operator Norm Ball (Q5146933) (← links)
- A Tale of Santa Claus, Hypergraphs and Matroids (Q5146963) (← links)
- A Fourier-Analytic Approach for the Discrepancy of Random Set Systems (Q5236346) (← links)
- A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies (Q5361827) (← links)
- (Q5365072) (← links)
- Diameter of polyhedra (Q5370739) (← links)
- Polynomiality for Bin Packing with a Constant Number of Item Types (Q5384022) (← links)
- Steiner Tree Approximation via Iterative Randomized Rounding (Q5395705) (← links)
- Matroids and integrality gaps for hypergraphic steiner tree relaxations (Q5415542) (← links)
- (Q5417686) (← links)
- 0/1 Polytopes with Quadratic Chvátal Rank (Q5739123) (← links)
- (Q5743405) (← links)
- Vector balancing in Lebesgue spaces (Q6074880) (← links)
