Pages that link to "Item:Q1375119"
From MaRDI portal
The following pages link to Approximation algorithms for maximum dispersion (Q1375119):
Displayed 32 items.
- Heuristic solution approaches for the maximum minsum dispersion problem (Q513174) (← links)
- Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? (Q621921) (← links)
- Computational geometric aspects of rhythm, melody, and voice-leading (Q733549) (← links)
- An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes (Q844164) (← links)
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469) (← links)
- Min sum clustering with penalties (Q976485) (← links)
- The equitable dispersion problem (Q1011261) (← links)
- Approximating the maximum quadratic assignment problem (Q1607075) (← links)
- Complexity of finding dense subgraphs (Q1613384) (← links)
- Approximation algorithms for the metric maximum clustering problem with given cluster sizes. (Q1811624) (← links)
- A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
- Measuring diversity. A review and an empirical analysis (Q2029033) (← links)
- Maximization problems of balancing submodular relevance and supermodular diversity (Q2070370) (← links)
- Result diversification by multi-objective evolutionary algorithms with theoretical guarantees (Q2152498) (← links)
- Two dimensional maximum weight matching using Manhattan topology (Q2157895) (← links)
- Dispersing and grouping points on planar segments (Q2232600) (← links)
- A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
- Iterated tabu search for the maximum diversity problem (Q2381330) (← links)
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (Q2391186) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← links)
- Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
- Truthful Mechanisms for Matching and Clustering in an Ordinal World (Q2959835) (← links)
- (Q5091024) (← links)
- An Improved Analysis of Local Search for Max-Sum Diversification (Q5108253) (← links)
- Max-min dispersion on a line (Q5918519) (← links)
- Maximum dispersion problem in dense graphs (Q5929139) (← links)
- Weakly Submodular Function Maximization Using Local Submodularity Ratio. (Q6065474) (← links)
- Away from each other (Q6091146) (← links)
- Obtaining approximately optimal and diverse solutions via dispersion (Q6109008) (← links)