Rothvoss, Thomas
- Constructive discrepancy minimization for convex sets
2014/04/01 by Rothvoss, Thomas · 6 citations
#Combinatorics (math.CO) #Computational Geometry (cs.CG) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
- Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method
2016/11/26 by Levy, Avi, Ramadas, Harishchandra, Rothvoss, Thomas · 5 citations
#Combinatorics (math.CO) #Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
- Polynomiality for Bin Packing with a Constant Number of Item Types
2013/07/19 by Goemans, Michel X., Rothvoss, Thomas · 3 citations
#Combinatorics (math.CO) #Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #G.1.6
- The Subspace Flatness Conjecture and Faster Integer Programming
2023/03/26 by Víctor Machado Reis, Reis, Victor, Thomas Rothvoß +1 · 5 citations
Computer Science · Mathematics · #15A #52A #52C #68Q #68R #68W #90B #90C #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.1.6 #Limits and Structures in Graph Theory #Optimization and Control (math.OC)
- A Tale of Santa Claus, Hypergraphs and Matroids
2018/07/19 by Sami Davies, Davies, Sami, Thomas Rothvoß +3 · 3 citations
Computer Science · #Optimization and Search Problems #Advanced Graph Theory Research #Complexity and Algorithms in Graphs
- Approximating Bin Packing within O(log OPT * log log OPT) bins
2013/01/17 by Rothvoss, Thomas · 2 citations
#Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
- A Logarithmic Additive Integrality Gap for Bin Packing
2015/03/30 by Hoberg, Rebecca, Rothvoss, Thomas · 2 citations
#Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
- A Fourier-Analytic Approach for the Discrepancy of Random Set Systems
2018/06/12 by Hoberg, Rebecca, Rothvoss, Thomas · 2 citations
#Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
- Linear Size Sparsifier and the Geometry of the Operator Norm Ball
2019/07/03 by Reis, Victor, Rothvoss, Thomas · 2 citations
#Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
- Prizing on Paths: A PTAS for the Highway Problem
2010/04/18 by Grandoni, Fabrizio, Rothvoss, Thomas · 1 citation
#Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
- Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations
2011/11/30 by Goemans, Michel X., Olver, Neil, Rothvoss, Thomas +1 · 1 citation
#Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
- The matching polytope has exponential extension complexity
2013/11/11 by Rothvoss, Thomas · 1 citation
#52B11 #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.1.6
- Number Balancing is as hard as Minkowski's Theorem and Shortest Vector
2016/11/26 by Hoberg, Rebecca, Ramadas, Harishchandra, Rothvoss, Thomas +1 · 1 citation
#Computational Complexity (cs.CC) #Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
- Forall-exist statements in pseudopolynomial time
2023/11/13 by Eleonore Bach, Friedrich Eisenbrand, Bach, Eleonore +3 · 2 citations
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Computational Geometry and Mesh Generation #FOS: Mathematics #Optimization and Control (math.OC) #Polynomial and algebraic computation
- Scheduling with Communication Delays via LP Hierarchies and Clustering
2020/04/21 by Sami Davies, Davies, Sami, Janardhan Kulkarni +7 · 1 citation
Computer Science · Engineering · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems #Scheduling and Optimization Algorithms
- A Geometric Perspective on the Injective Norm of Sums of Random Tensors
2024/11/15 by Bandeira, Afonso S., Gopi, Sivakanth, Jiang, Haotian +2 · 3 citations
#FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Probability (math.PR) #Statistics Theory (math.ST)
- On the Hardness of Scheduling With Non-Uniform Communication Delays
2021/04/30 by Davies, Sami, Kulkarni, Janardhan, Rothvoss, Thomas +3 · 1 citation
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
- Optimal Online Discrepancy Minimization
2023/08/02 by Janardhan Kulkarni, Victor Reis, Kulkarni, Janardhan +3 · 2 citations
Computer Science · Mathematics · #Benford’s Law and Fraud Detection #Complexity and Algorithms in Graphs #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
- Tight bounds on the Fourier growth of bounded functions on the hypercube
2021/07/13 by Siddharth Iyer, Iyer, Siddharth, Anup Rao +7 · 1 citation
Mathematics · #Advanced Topology and Set Theory #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Functional Analysis (math.FA) #Limits and Structures in Graph Theory #Meromorphic and Entire Functions
- The Vector Balancing Constant for Zonotopes
2022/10/29 by Laurel Heck, Víctor Machado Reis, Heck, Laurel +3 · 1 citation
Mathematics · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Metric Geometry (math.MG) #Point processes and geometric inequalities