Pages that link to "Item:Q679447"

The following pages link to Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION (Q679447):

Displaying 50 items.

• Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
• Memetic search for the max-bisection problem (Q339560) (← links)
• An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
• Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs (Q421275) (← links)
• Bisections of graphs (Q461728) (← links)
• Algorithmic aspects of homophyly of networks (Q501003) (← links)
• 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)
• New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
• A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
• Improved approximation algorithms for maximum graph partitioning problems (Q813332) (← links)
• On approximating complex quadratic optimization problems via semidefinite programming relaxations (Q877200) (← links)
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← 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)
• Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH (Q1430177) (← links)
• Semidefinite programming (Q1600854) (← links)
• A note on approximating Max-Bisection on regular graphs (Q1603473) (← links)
• Approximating the maximum quadratic assignment problem (Q1607075) (← links)
• Approximation and hardness results for the max \(k\)-uncut problem (Q1630990) (← links)
• Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
• A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
• Projection results for the \(k\)-partition problem (Q1751250) (← links)
• On approximation of max-vertex-cover (Q1848386) (← links)
• Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
• On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
• An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
• An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
• Correlation clustering in data streams (Q2037102) (← links)
• Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
• Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs (Q2039649) (← links)
• A new greedy strategy for maximizing monotone submodular function under a cardinality constraint (Q2141724) (← links)
• Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
• Approximation algorithms for two variants of correlation clustering problem (Q2156281) (← links)
• Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
• A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
• Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis (Q2205985) (← links)
• A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
• Dominance inequalities for scheduling around an unrestrictive common due date (Q2242293) (← links)
• Max-bisections of \(H\)-free graphs (Q2279266) (← links)
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
• A max-cut approach to heterogeneity in cryo-electron microscopy (Q2320121) (← links)
• A max-cut approximation using a graph based MBO scheme (Q2326619) (← links)
• Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)