Pages that link to "Item:Q2817633"
From MaRDI portal
The following pages link to .878-approximation algorithms for MAX CUT and MAX 2SAT (Q2817633):
Displaying 50 items.
- Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat} (Q293272) (← links)
- Approximation of rank function and its application to the nearest low-rank correlation matrix (Q386463) (← links)
- Constructing uniquely realizable graphs (Q393739) (← links)
- Energy efficient monitoring in sensor networks (Q627527) (← links)
- The real positive semidefinite completion problem for series-parallel graphs (Q676039) (← links)
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION (Q679447) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
- On the approximability of Max-Cut (Q873802) (← links)
- Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems (Q947643) (← links)
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints (Q980434) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- A combinatorial algorithm for MAX CSP (Q1007550) (← links)
- Path optimization for graph partitioning problems (Q1276954) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- On dependent randomized rounding algorithms (Q1306458) (← links)
- Approximability of maximum splitting of k-sets and some other Apx-complete problems (Q1350605) (← links)
- On approximation algorithms for the minimum satisfiability problem (Q1351157) (← links)
- Parallel approximation algorithms by positive linear programming (Q1386460) (← links)
- Clique is hard to approximate within \(n^{1-\epsilon}\) (Q1588908) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- A randomized approximation scheme for metric MAX-CUT (Q1604207) (← links)
- Finding the maximum cut by the greedy algorithm (Q1711379) (← links)
- Ellipsoidal bounds for uncertain linear equations and dynamical systems (Q1879588) (← links)
- Random sampling and approximation of MAX-CSPs (Q1886453) (← links)
- The expected relative error of the polyhedral approximation of the max- cut problem (Q1892101) (← links)
- On a positive semidefinite relaxation of the cut polytope (Q1894508) (← links)
- Solving the max-cut problem using eigenvalues (Q1900149) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- Maximum renamable Horn sub-CNFs (Q1961445) (← links)
- On computational capabilities of Ising machines based on nonlinear oscillators (Q2150420) (← links)
- Max-bisections of \(H\)-free graphs (Q2279266) (← links)
- Eigenvector-based identification of bipartite subgraphs (Q2328104) (← links)
- Better approximation algorithms for influence maximization in online social networks (Q2352355) (← links)
- Solving the maximum duo-preservation string mapping problem with linear programming (Q2440161) (← links)
- Impact of graph structures for QAOA on maxcut (Q2685581) (← links)
- Approximation algorithms for MAX-4-SAT and rounding procedures for semidefinite programs (Q2746433) (← links)
- Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems (Q2819597) (← links)
- SDP gaps and UGC-hardness for max-cut-gain (Q3002802) (← links)
- Improved approximation of Max-Cut on graphs of bounded degree (Q3150283) (← links)
- NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT (Q4446321) (← links)
- Gadgets, Approximation, and Linear Programming (Q4507337) (← links)
- The \(\text{RPR}^2\) rounding technique for semidefinite programs (Q4535020) (← links)
- On dependent randomized rounding algorithms (Q4645933) (← links)
- Coloring bipartite hypergraphs (Q4645934) (← links)
- Improved randomized approximation algorithms for lot-sizing problems (Q4645935) (← links)
- Approximation of Constraint Satisfaction via local search (Q5057457) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- (Q5092461) (← links)
