- The sphere packing problem in dimension 24
2016/03/31 by Henry Cohn, Abhinav Kumar, Stephen D. Miller +2 · 3 citations
Computer Science · Mathematics · #Circle packing #Combinatorics #Digital Image Processing Techniques #Dimension (graph theory) #Function (biology) #Geometry #Lattice (music) #Linear programming #Mathematical Approximation and Integration #Mathematical optimization #Mathematics #Packing problems #Point processes and geometric inequalities #SPHERES #Sphere packing #math.MG #math.NT
- Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search
2013/10/01 by Marek Cygan · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Limits and Structures in Graph Theory #Combinatorics #Mathematics #Packing problems #Approximation algorithm #Local search (optimization) #Matching (statistics) #Discrete mathematics #Bounded function #Constant (computer programming) #Time complexity #Disjoint sets #Algorithm #Computer science #Statistics
- Landscape analysis of constraint satisfaction problems
2007/02/28 by Florent Krzakala, Florent Krząkała, Jorge Kurchan · 8 citations
Agricultural and Biological Sciences · Computer Science · Mathematics · Physics and Astronomy · #Artificial intelligence #Benchmark (surveying) #Cluster analysis #Combinatorics #Computer science #Constraint (computer-aided design) #Constraint Satisfaction and Optimization #Constraint satisfaction problem #Context (archaeology) #Data Visualization and Analytics #Geography #Geometry #Graph #Graph coloring #Mathematical optimization #Mathematics #Packing problems #Point (geometry) #Sensory Analysis and Statistical Methods #Simple (philosophy) #cond-mat.dis-nn #cond-mat.stat-mech #cs.CC #nlin.CD
- Polynomial-time approximation schemes for packing and piercing fat objects
2003/02/01 by Timothy M. Chan, Timothy M Chan · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Approximation algorithm #Combinatorics #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Computer science #Dimension (graph theory) #Disjoint sets #Geometry #Mathematical analysis #Mathematics #Packing problems #Point (geometry) #Polynomial #Polynomial-time approximation scheme #Set (abstract data type) #Subdivision #Time complexity
- Approximation Hardness for Small Occurrence Instances of NP-Hard Problems
2003/01/01 by Miroslav Chlebík, Janka Chlebíková, Janka Chlebı́ková · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Approximation algorithm #Bounded function #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Hardness of approximation #Matching (statistics) #Mathematics #NP-complete #Optimization and Search Problems #Packing problems #Statistics #Time complexity #Upper and lower bounds
- New upper bounds on sphere packings I
2001/10/31 by Henry Cohn, Noam Elkies, Noam D. Elkies · 41 citations
Computer Science · Engineering · Mathematics · #Circle packing #Combinatorics #Computational Geometry and Mesh Generation #Conjecture #Geometry #Mathematical Approximation and Integration #Mathematical analysis #Mathematics #Packing problems #SPHERES #Sphere packing #Upper and lower bounds #graph theory and CDMA systems #math.MG
- On Integrality, Stability and Composition of Dicycle Packings and Covers
2000/06/01 by Zeev Nutov, Michal Penn · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Cover (algebra) #Digraph #Discrete mathematics #Disjoint sets #Graph #Mathematics #Packing problems #Set (abstract data type) #Set packing #Simple (philosophy) #Vertex (graph theory)
- A polynomial time solution for labeling a rectilinear map
1998/02/01 by Chung Keung Poon, Binhai Zhu, Zhu Binhai +1 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Numerical Analysis Techniques #Algorithm #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Constant (computer programming) #Discrete mathematics #Disjoint sets #Geometry #Line segment #Mathematical analysis #Mathematics #Natural number #Optimization and Packing Problems #Packing problems #Polynomial #Polynomial-time approximation scheme #Rectangle #Scheme (mathematics) #Time complexity
- Inefficiency in packing squares with unit squares
1978/03/01 by K. F. Roth, K.F Roth, R. C. Vaughan +1 · 3 citations
Engineering · Mathematics · #Combinatorics #Computer science #Economics #Geometry #Inefficiency #Least-squares function approximation #Limits and Structures in Graph Theory #Mathematics #Microeconomics #Packing problems #Point processes and geometric inequalities #Square (algebra) #Statistics #Unit (ring theory) #Unit square #graph theory and CDMA systems