Approximation Algorithms for Dispersion Problems

DOI10.1006/jagm.2000.1145zbMath0974.68153OpenAlexW2001554016MaRDI QIDQ2729645

Barun Chandra, Magnús M. Halldórsson

Publication date: 23 July 2001

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2000.1145

zbMATH Keywords

dispersion problems

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (14)

Provable randomized rounding for minimum-similarity diversification ⋮ A review on algorithms for maximum clique problems ⋮ Iterated tabu search for the maximum diversity problem ⋮ Result diversification by multi-objective evolutionary algorithms with theoretical guarantees ⋮ 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 ⋮ Away from each other ⋮ The dispersive art gallery problem ⋮ A linear time approximation scheme for computing geometric maximum \(k\)-star ⋮ Dispersing and grouping points on planar segments ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Unnamed Item ⋮ Max-min dispersion on a line ⋮ A hybrid metaheuristic method for the maximum diversity problem

This page was built for publication: Approximation Algorithms for Dispersion Problems