- Steiner Tree Approximation via Iterative Randomized Rounding
2013/02/01 by Jarosław Byrka, Fabrizio Grandoni, Thomas Rothvoss +2 · 23 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Approximation algorithm #Binary tree #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Iterative method #K-ary tree #Linear programming #Linear programming relaxation #Machine Learning and Algorithms #Mathematical optimization #Mathematics #Minimum spanning tree #Randomized rounding #Relaxation (psychology) #Rounding #Sequence (biology) #Steiner tree problem #Tree (set theory) #Tree structure #k-minimum spanning tree
- Approximation Algorithms for Maximum Independent Set of Pseudo-Disks
2012/03/06 by Timothy M. Chan, Sariel Har-Peled · 2 citations
Computer Science · Engineering · Mathematics · #Algorithm #Approximation algorithm #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Data Management and Algorithms #Discrete mathematics #Geometry #Graph #Independent set #Linear programming #Linear programming relaxation #Mathematics #Optimization and Packing Problems #Plane (geometry) #Relaxation (psychology) #Rounding #Set (abstract data type) #Set packing
- An improved LP-based approximation for steiner tree
2010/06/05 by Jarosław Byrka, Fabrizio Grandoni, Thomas Rothvoß +1 · 1 citation
Computer Science · Engineering · Mathematics · #Complexity and Algorithms in Graphs #VLSI and FPGA Design Techniques #Advanced Graph Theory Research #Steiner tree problem #Rounding #Combinatorics #k-minimum spanning tree #Approximation algorithm #Mathematics #Linear programming relaxation #Tree (set theory) #Minimum spanning tree #Randomized rounding #Spanning tree #Relaxation (psychology) #Discrete mathematics #Sequence (biology) #Graph #K-ary tree #Mathematical optimization #Tree structure #Computer science #Linear programming #Binary tree
- On approximability of linear ordering and related NP-optimization problems on graphs
2003/09/16 by Sounaka Mishra, Kripasindhu Sikdar · 1 citation
Computer Science · Mathematics · #APX #Advanced Graph Theory Research #Approximation algorithm #Combinatorics #Complexity and Algorithms in Graphs #Conjecture #Discrete mathematics #Generalization #Graph #Linear programming #Linear programming relaxation #Mathematical analysis #Mathematical optimization #Mathematics #Maximum cut #Optimization and Search Problems #Polytope #Vertex (graph theory)
- A polyhedral approach to edge coloring
1991/08/01 by George L Nemhauser, George L. Nemhauser, Sungsoo Park · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Artificial intelligence #Branch and cut #Branch and price #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Edge coloring #Enhanced Data Rates for GSM Evolution #Graph #Graph coloring #Integer programming #Line graph #Linear programming #Linear programming relaxation #Matching (statistics) #Mathematical optimization #Mathematics #Optimization and Search Problems #Relaxation (psychology) #Simple (philosophy)