Pages that link to "Item:Q679447"
From MaRDI portal
The following pages link to Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION (Q679447):
Displayed 27 items.
- Angular synchronization by eigenvectors and semidefinite programming (Q617701) (← links)
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
- Semi-definite relaxation algorithm of multiple knapsack problem (Q698390) (← links)
- Improved approximation algorithms for maximum graph partitioning problems (Q813332) (← links)
- On approximating complex quadratic optimization problems via semidefinite programming relaxations (Q877200) (← links)
- The capacitated max \(k\)-cut problem (Q930343) (← links)
- A modified VNS metaheuristic for max-bisection problems (Q939544) (← links)
- On the tractability of coloring semirandom graphs (Q975431) (← links)
- A combinatorial algorithm for MAX CSP (Q1007550) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- An approximation algorithm for scheduling two parallel machines with capacity constraints. (Q1408454) (← links)
- Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
- Semidefinite programming (Q1600854) (← links)
- A note on approximating Max-Bisection on regular graphs (Q1603473) (← links)
- Approximating the maximum quadratic assignment problem (Q1607075) (← links)
- On approximation of max-vertex-cover (Q1848386) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
- Approximation algorithms for maximum cut with limited unbalance (Q2456360) (← links)
- Approximating the fixed linear crossing number (Q2456999) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- A semidefinite programming approach to the hypergraph minimum bisection problem (Q2996813) (← links)
- Approximability Distance in the Space of H-Colourability Problems (Q3392945) (← links)
- Approximate Kernel Clustering (Q3400770) (← links)
- Approximating Max Cut with Limited Unbalance (Q3439482) (← links)
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems (Q4537628) (← links)
- Approximating the 2-catalog segmentation problem using semidefinite programming relaxations (Q4650629) (← links)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)