Systems of distant representatives in Euclidean space
From MaRDI portal
Publication:2347967
Recommendations
Cites work
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- scientific article; zbMATH DE number 863471 (Why is no real title available?)
- A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
- A course in combinatorics.
- Approximation algorithms for spreading points
- Approximation of geometric dispersion problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Dispersion in disks
- Hall's theorem for hypergraphs
- Introduction to algorithms.
- Maximum area independent sets in disk intersection graphs
- On Representatives of Subsets
- Pushing disks apart - the Kneser-Poulsen conjecture in the plane
- Some Covering Theorems (I)
- Some Covering Theorems (II)
- Some Covering Theorems (III)
- Some Intersection Properties of Convex Bodies
- Systems of distant representatives
- The Marriage Problem
- The Problem of Compatible Representatives
Cited in
(4)
This page was built for publication: Systems of distant representatives in Euclidean space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2347967)