Pages that link to "Item:Q2391186"
From MaRDI portal
The following pages link to An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (Q2391186):
Displaying 9 items.
- Maximization problems of balancing submodular relevance and supermodular diversity (Q2070370) (← links)
- Result diversification by multi-objective evolutionary algorithms with theoretical guarantees (Q2152498) (← 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)
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)
- Weakly Submodular Function Maximization Using Local Submodularity Ratio. (Q6065474) (← links)
- Away from each other (Q6091146) (← links)