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 14 items.
- 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)
- 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)
- 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)
- A continuation algorithm for max-cut problem (Q2644353) (← 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)
- Geometric invariant theory and flips (Q5687280) (← links)