Pages that link to "Item:Q1604207"
From MaRDI portal
The following pages link to A randomized approximation scheme for metric MAX-CUT (Q1604207):
Displaying 15 items.
- NP-hardness of the Euclidean Max-Cut problem (Q471386) (← links)
- NP-hardness of some quadratic Euclidean 2-clustering problems (Q906118) (← links)
- Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
- On metric clustering to minimize the sum of radii (Q970610) (← links)
- Min sum clustering with penalties (Q976485) (← links)
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center (Q1746358) (← links)
- On the complexity of some quadratic Euclidean 2-clustering problems (Q2630045) (← links)
- On the practically interesting instances of MAXCUT (Q2957913) (← links)
- Exact pseudopolynomial algorithms for a balanced 2-clustering problem (Q2959183) (← links)
- Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms (Q3503606) (← links)
- On Metric Clustering to Minimize the Sum of Radii (Q3512466) (← links)
- On the optimality of the random hyperplane rounding technique for MAX CUT (Q4537629) (← links)
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (Q5043014) (← links)
- Complexity of the weighted max-cut in Euclidean space (Q5264746) (← links)
- (Q5743481) (← links)
