Maximum dispersion and geometric maximum weight cliques

DOI10.1007/s00453-003-1074-xzbMath1095.68082OpenAlexW2745300566MaRDI QIDQ1879248

Sándor P. Fekete, Henk G. Meijer

Publication date: 22 September 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15964

zbMATH Keywords

polynomial-time approximation scheme

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (13)

An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs ⋮ A review on discrete diversity and dispersion maximization from an OR perspective ⋮ Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? ⋮ Away from each other ⋮ The dispersive art gallery problem ⋮ An Improved Analysis of Local Search for Max-Sum Diversification ⋮ A linear time approximation scheme for computing geometric maximum \(k\)-star ⋮ Algorithms for \(k\)-dispersion for points in convex position in the plane ⋮ Efficient Approximations for the Online Dispersion Problem ⋮ Communication-aware processor allocation for supercomputers: Finding point sets of small average distance ⋮ Unnamed Item ⋮ Computational geometric aspects of rhythm, melody, and voice-leading ⋮ Max-min dispersion on a line

This page was built for publication: Maximum dispersion and geometric maximum weight cliques