Pages that link to "Item:Q1375119"
From MaRDI portal
The following pages link to Approximation algorithms for maximum dispersion (Q1375119):
Displayed 11 items.
- 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)
- 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)
- 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)
- The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
- Maximum dispersion problem in dense graphs (Q5929139) (← links)