Approximation algorithms for dispersion problems
From MaRDI portal
Recommendations
Cited in
(39)- Minimum dispersion problems
- Approximation algorithms for maximum dispersion
- A linear time approximation scheme for computing geometric maximum \(k\)-star
- New approximation algorithms for weighted maximin dispersion problem with box or ball constraints
- Provable randomized rounding for minimum-similarity diversification
- Result diversification by multi-objective evolutionary algorithms with theoretical guarantees
- Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem
- Dispersing and grouping points on planar segments
- A hybrid metaheuristic method for the maximum diversity problem
- Iterated tabu search for the maximum diversity problem
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- A review on algorithms for maximum clique problems
- A review on discrete diversity and dispersion maximization from an OR perspective
- scientific article; zbMATH DE number 1696526 (Why is no real title available?)
- Approximation algorithms for spreading points
- Heuristic and Special Case Algorithms for Dispersion Problems
- scientific article; zbMATH DE number 1182762 (Why is no real title available?)
- Efficient approximations for the online dispersion problem
- Facility dispersion and remote subgraphs
- Diversity maximization in doubling metrics
- Efficient Approximations for the Online Dispersion Problem
- Approximation Guarantees for Max Sum and Max Min Facility Dispersion with Parameterised Triangle Inequality and Applications in Result Diversification
- Solving Generalized Maximum Dispersion with Linear Programming
- Obtaining online approximation algorithms for facility dispersion from offline algorithms
- Approximation and Online Algorithms
- Max-min dispersion on a line
- Max-min dispersion on a line
- Approximation of geometric dispersion problems
- Away from each other
- The dispersive art gallery problem
- Finding diverse strings and longest common subsequences in a graph
- Algorithms for minimizing the movements of spreading points in linear domains
- Diverse data selection under fairness constraints
- Construction and improvement algorithms for dispersion problems
- A couple of simple algorithms for k-dispersion
- Max-min four-dispersion problems
- Exact algorithms for the max-min dispersion problem
- Approximate solutions of continuous dispersion problems
This page was built for publication: Approximation algorithms for dispersion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2729645)
