| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6875812 | Theoretical Computer Science | 2017 | 25 Pages |
Abstract
We also develop new approximate solutions to the interval selection problem, where the intervals have real endpoints and we want to report a feasible solution, that use O(α(I)) space. Our algorithms for the interval selection problem match the optimal results by Emek, Halldórsson and Rosén [Space-Constrained Interval Selection, TALG 2016], but are much simpler.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sergio Cabello, Pablo Pérez-Lantero,