Away from each other
From MaRDI portal
Recommendations
Cites work
- A study on two geometric location problems
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
- Approximation algorithms for dispersion problems
- Approximation algorithms for maximum dispersion
- Approximation algorithms for spreading points
- Approximation Guarantees for Max Sum and Max Min Facility Dispersion with Parameterised Triangle Inequality and Applications in Result Diversification
- Computational aspects of packing problems
- Dispersing points on intervals
- Dispersion in disks
- Exact algorithms for the max-min dispersion problem
- Heuristic and Special Case Algorithms for Dispersion Problems
- scientific article; zbMATH DE number 1182762 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- scientific article; zbMATH DE number 7740872 (Why is no real title available?)
- Introduction to algorithms.
- Local Search for Max-Sum Diversification
- Max-min dispersion on a line
- Max-sum diversity via convex programming
- Maximum dispersion and geometric maximum weight cliques
- Optimal shortest path queries in a simple polygon
- Packing disks into disks with optimal worst-case density
- Systems of distant representatives
- The discrete p-dispersion problem
This page was built for publication: Away from each other
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6091146)