Pages that link to "Item:Q1879248"
From MaRDI portal
The following pages link to Maximum dispersion and geometric maximum weight cliques (Q1879248):
Displaying 17 items.
- 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)
- Approximation algorithms for maximum dispersion (Q1375119) (← links)
- Maximum weight relaxed cliques and Russian doll search revisited (Q1686057) (← links)
- A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
- Facility dispersion problems under capacity and cost constraints (Q1977861) (← links)
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (Q2391186) (← links)
- Communication-aware processor allocation for supercomputers: Finding point sets of small average distance (Q2480901) (← links)
- A review on discrete diversity and dispersion maximization from an OR perspective (Q2670513) (← links)
- Efficient Approximations for the Online Dispersion Problem (Q4634023) (← links)
- Facility dispersion and remote subgraphs (Q5054806) (← 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)
- The dispersive art gallery problem (Q6092310) (← links)
- On flipping the Fréchet distance (Q6647773) (← links)