Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315): Difference between revisions

@@ Property / author @@
-Da-Chuan Xu
@@ Property / author: Da-Chuan Xu / rank @@
-Normal rank
@@ Property / author @@
-Q185359
@@ Property / author: Q185359 / rank @@
-Normal rank
@@ Property / author @@
+Da-Chuan Xu
@@ Property / author: Da-Chuan Xu / rank @@
+Normal rank
@@ Property / author @@
+Shu-Zhong Zhang
@@ Property / author: Shu-Zhong Zhang / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Outward rotations
@@ Property / describes a project that uses: Outward rotations / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11425-007-0080-x
+Normal rank
@@ Property / OpenAlex ID @@
+W1971287361
@@ Property / OpenAlex ID: W1971287361 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms
+Normal rank
@@ Property / cites work @@
+Outward rotations
@@ Property / cites work: Outward rotations / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite Subgraphs and the Smallest Eigenvalue
@@ Property / cites work: Bipartite Subgraphs and the Smallest Eigenvalue / rank @@
+Normal rank
@@ Property / cites work @@
+On the optimality of the random hyperplane rounding technique for MAX CUT
+Normal rank
@@ Property / cites work @@
+How Good is the Goemans--Williamson MAX CUT Algorithm?
+Normal rank
@@ Property / cites work @@
+Q4526964
@@ Property / cites work: Q4526964 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4247459
@@ Property / cites work: Q4247459 / rank @@
+Normal rank
@@ Property / cites work @@
+Semidefinite programming in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+An improved rounding method and semidefinite programming relaxation for graph partition
+Normal rank
@@ Property / cites work @@
+A Spectral Bundle Method for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+Q4407449
@@ Property / cites work: Q4407449 / rank @@
+Normal rank
@@ Property / cites work @@
+Semidefinite programming and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Approximating the 2-catalog segmentation problem using semidefinite programming relaxations
+Normal rank
@@ Property / cites work @@
+On maximization of quadratic form over intersection of ellipsoids with common center
+Normal rank
@@ Property / cites work @@
+Semidefinite relaxation and nonconvex quadratic optimization
+Normal rank
@@ Property / cites work @@
+Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
+Normal rank
@@ Property / cites work @@
+Approximating quadratic programming with bound and quadratic constraints
+Normal rank
@@ Property / cites work @@
+Approximating global quadratic optimization with convex quadratic constraints
+Normal rank
@@ Property / cites work @@
+Quadratic maximization and semidefinite relaxation
+Normal rank
@@ Property / cites work @@
+On Cones of Nonnegative Quadratic Functions
@@ Property / cites work: On Cones of Nonnegative Quadratic Functions / rank @@
+Normal rank
@@ Property / cites work @@
+New Results on Quadratic Minimization
@@ Property / cites work: New Results on Quadratic Minimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4535020
@@ Property / cites work: Q4535020 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation of Max-Cut on graphs of bounded degree
+Normal rank