Dispersing points on intervals
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 177561 (Why is no real title available?)
- A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
- A note on scheduling equal-length jobs to maximize throughput
- A study of single-machine scheduling problem to maximize throughput
- A study on two geometric location problems
- Approximation of geometric dispersion problems
- Heuristic and Special Case Algorithms for Dispersion Problems
- Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
- New results in the packing of equal circles in a square
- Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
- Optimal packing and covering in the plane are NP-complete
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
- Scheduling of unit-length independent tasks with execution constraints
- Solving Generalized Maximum Dispersion with Linear Programming
- TSP with locational uncertainty: the adversarial model
- The densest packing of equal circles into a parallel strip
- The discrete p-dispersion problem
- The equitable dispersion problem
Cited in
(6)- Dispersing points on intervals
- Dispersing and grouping points on planar segments
- Excess deviations for points disconnected by random interlacements
- The dispersive art gallery problem
- scientific article; zbMATH DE number 1102883 (Why is no real title available?)
- Computing largest minimum color-spanning intervals of imprecise points
This page was built for publication: Dispersing points on intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1706121)