Pages that link to "Item:Q1849503"
From MaRDI portal
The following pages link to An improved rounding method and semidefinite programming relaxation for graph partition (Q1849503):
Displayed 37 items.
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Improved approximation algorithms for maximum graph partitioning problems (Q813332) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints (Q980434) (← links)
- Graph bisection revisited (Q1657405) (← links)
- Uniform \(K\)-stability, Duistermaat-Heckman measures and singularities of pairs (Q1687881) (← links)
- Functorial factorization of birational maps for qe schemes in characteristic 0 (Q1736426) (← links)
- A discrete dynamic convexized method for the max-cut problem (Q1761827) (← links)
- On approximation of max-vertex-cover (Q1848386) (← links)
- Improved approximations for max set splitting and max NAE SAT (Q1878408) (← links)
- Approximation algorithm for MAX DICUT with given sizes of parts (Q1879136) (← links)
- On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← 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)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← links)
- A continuation algorithm for max-cut problem (Q2644353) (← links)
- Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
- Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
- Torification and factorization of birational maps (Q4330565) (← links)
- Algebraic cuts (Q4383046) (← links)
- 𝜋₁ of Hamiltonian 𝑆¹ manifolds (Q4417262) (← links)
- Approximating the 2-catalog segmentation problem using semidefinite programming relaxations (Q4650629) (← links)
- Equivariant multiplicities of simply-laced type flag minors (Q5020290) (← links)
- Floer cohomology and flips (Q5097141) (← links)
- Geometric invariant theory and flips (Q5687280) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5918330) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5919045) (← links)
- Matroid-constrained vertex cover (Q6162073) (← links)