Pages that link to "Item:Q3132860"
From MaRDI portal
The following pages link to Max-sum diversity via convex programming (Q3132860):
Displaying 11 items.
- Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)
- Result diversification by multi-objective evolutionary algorithms with theoretical guarantees (Q2152498) (← links)
- Selecting a subset of diverse points based on the squared Euclidean distance (Q2163859) (← links)
- \(t\)-linearization for the maximum diversity problem (Q2230803) (← links)
- Maximizing single attribute diversity in group selection (Q2678607) (← links)
- Local Search for Max-Sum Diversification (Q4575743) (← links)
- Efficient Approximations for the Online Dispersion Problem (Q4634023) (← links)
- (Q5091024) (← links)
- An Improved Analysis of Local Search for Max-Sum Diversification (Q5108253) (← links)
- Max-min dispersion on a line (Q5918519) (← links)
- Away from each other (Q6091146) (← links)