- 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)
- An Algorithmic Theory of Integer Programming
2019/04/02 by Friedrich Eisenbrand, Eisenbrand, Friedrich, Christoph Hunkenschröder +9 · 3 citations
Computer Science · Mathematics · #15A #52B #52C #68Q #68R #68W #90B #90C #Advanced Graph Theory Research #Advanced Optimization Algorithms Research #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 #Optimization and Control (math.OC)
- Simulation of simplicity: a technique to cope with degenerate cases in\n geometric algorithms
1994/10/11 by Herbert Edelsbrunner, Edelsbrunner, Herbert, Ernst P. Mücke +1 · 10 citations
Computer Science · Engineering · #68Q #Advanced Numerical Analysis Techniques #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Computational Geometry and Mesh Generation #FOS: Computer and information sciences #FOS: Mathematics #Manufacturing Process and Optimization