Pages that link to "Item:Q4537628"

The following pages link to A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems (Q4537628):

Displaying 33 items.

• 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)
• Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
• A 2-approximation for the maximum satisfying bisection problem (Q531427) (← links)
• A new Lagrangian net algorithm for solving max-bisection problems (Q544198) (← links)
• Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION (Q679447) (← links)
• Simple probabilistic analysis to generalize bottleneck graph multi-partitioning (Q714518) (← links)
• New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
• Improved approximation algorithms for maximum graph partitioning problems (Q813332) (← links)
• A modified VNS metaheuristic for max-bisection problems (Q939544) (← links)
• Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH (Q1430177) (← 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)
• Assortment planning for multiple chain stores (Q2319385) (← links)
• Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)
• An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (Q2354294) (← links)
• Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix (Q2358291) (← links)
• An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation (Q2358849) (← links)
• Bounds on the bisection width for random \(d\)-regular graphs (Q2381523) (← links)
• Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems (Q2444145) (← links)
• A multiple penalty function method for solving max-bisection problems (Q2489432) (← links)
• Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement (Q4389077) (← links)
• An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems (Q4925247) (← links)
• An Enhancement of the Bisection Method Average Performance Preserving Minmax Optimality (Q5025219) (← links)
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465866) (← links)
• (Q5499455) (← links)
• (Q5743406) (← links)
• Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder (Q5875476) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
• A .699-approximation algorithm for Max-Bisection. (Q5930726) (← links)
• A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (Q6064054) (← links)