Improved approximation algorithms for MAX k-CUT and MAX BISECTION
From MaRDI portal
(Redirected from Publication:3499508)
Improved approximation algorithms for MAX \(k\)-CUT and MAX BISECTION
Improved approximation algorithms for MAX \(k\)-CUT and MAX BISECTION
Recommendations
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- scientific article; zbMATH DE number 1762086
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A .699-approximation algorithm for Max-Bisection.
Cited in
(63)- Spectral partitioning with multiple eigenvectors
- Laplacian eigenvalues and fixed size multisection
- Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH
- Maximally stable Gaussian partitions with discrete applications
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring
- Approximation algorithm for MAX DICUT with given sizes of parts
- A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section
- An improved kernel for max-bisection above tight lower bound
- SDP-based bounds for graph partition via extended ADMM
- A representation theory perspective on simultaneous alignment and classification
- Approximating max-cut under graph-MSO constraints
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
- Approximation algorithms for maximum cut with limited unbalance
- On approximation of max \(\frac{n}{2}\)-uncut problem
- A multiple penalty function method for solving max-bisection problems
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem
- Clustering with qualitative information
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
- scientific article; zbMATH DE number 1617262 (Why is no real title available?)
- scientific article; zbMATH DE number 1670644 (Why is no real title available?)
- scientific article; zbMATH DE number 1688377 (Why is no real title available?)
- Semi-definite positive programming relaxations for graph K_n-coloring in frequency assignment.
- Engineering branch-and-cut algorithms for the equicut problem
- Sharp spectral bounds of several graph parameters using eigenvector norms
- Approximate Max k-Cut with subgraph guarantee
- Complexity of approximating CSP with balance/hard constraints
- Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning
- scientific article; zbMATH DE number 5734227 (Why is no real title available?)
- scientific article; zbMATH DE number 1332666 (Why is no real title available?)
- Realignment in the National Football League: Did they do it right?
- scientific article; zbMATH DE number 2063458 (Why is no real title available?)
- scientific article; zbMATH DE number 1496577 (Why is no real title available?)
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization
- Approximation Algorithms for Some Graph Partitioning Problems
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- scientific article; zbMATH DE number 1762086 (Why is no real title available?)
- A combinatorial design approach to MAXCUT
- Near-optimal approximation algorithm for simultaneous Max-Cut
- Robust discriminative clustering with sparse regularizers
- Cone-LP's and semidefinite programs: geometry and a simplex-type method
- A combinatorial design approach to MAXCUT
- The Maximum k-Colorable Subgraph Problem and Related Problems
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
- Constrained submodular maximization via a nonsymmetric technique
- Three candidate plurality is stablest for small correlations
- Complex semidefinite programming and Max-\(k\)-Cut
- Constant factor Lasserre integrality gaps for graph partitioning problems
- Approximation algorithms for max cut and max bisection problems using semidefinite programming relaxations
- scientific article; zbMATH DE number 5232308 (Why is no real title available?)
- A new Lagrangian net algorithm for solving max-bisection problems
- Approximating Maximum Cut with Limited Unbalance
- Energy Efficient Monitoring in Sensor Networks
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection
- Graph-Theoretic Concepts in Computer Science
- A .699-approximation algorithm for Max-Bisection.
- Energy efficient monitoring in sensor networks
- 10 problems for partitions of triangle-free graphs
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- Approximate quantum 3-colorings of graphs and the quantum max 3-cut problem
- Improved approximation algorithms for maximum graph partitioning problems
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints
This page was built for publication: Improved approximation algorithms for MAX \(k\)-CUT and MAX BISECTION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3499508)
