{"paper":{"title":"Interval Selection in the Streaming Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pablo P\\'erez-Lantero, Sergio Cabello","submitted_at":"2015-01-09T22:52:21Z","abstract_excerpt":"A set of intervals is independent when the intervals are pairwise disjoint. In the interval selection problem we are given a set $\\mathbb{I}$ of intervals and we want to find an independent subset of intervals of largest cardinality. Let $\\alpha(\\mathbb{I})$ denote the cardinality of an optimal solution. We discuss the estimation of $\\alpha(\\mathbb{I})$ in the streaming model, where we only have one-time, sequential access to the input intervals, the endpoints of the intervals lie in $\\{1,...,n \\}$, and the amount of the memory is constrained.\n  For intervals of different sizes, we provide an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02285","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}