Pages that link to "Item:Q1430177"
From MaRDI portal
The following pages link to Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH (Q1430177):
Displaying 7 items.
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
- Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)
- Approximation of dense-\(n/2\)-subgraph and the complement of min-bisection (Q1810886) (← 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)
- A continuation algorithm for max-cut problem (Q2644353) (← links)
