Space-constrained interval selection

Yuval Emek; Magnús M. Halldórsson; Adi Rosén

doi:10.1007/978-3-642-31594-7_26

Space-constrained interval selection

Yuval Emek, Magnús M. Halldórsson, Adi Rosén

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We study streaming algorithms for the interval selection problem: finding a maximum cardinality subset of disjoint intervals on the line. A deterministic 2-approximation streaming algorithm for this problem is developed, together with an algorithm for the special case of proper intervals, achieving improved approximation ratio of 3/2. We complement these upper bounds by proving that they are essentially best possible in the streaming setting: it is shown that an approximation ratio of 2 - ε (or 3 / 2 - ε for proper intervals) cannot be achieved unless the space is linear in the input size. In passing, we also answer an open question of Adler and Azar [1] regarding the space complexity of constant-competitive randomized preemptive online algorithms for the same problem.

Original language	English
Title of host publication	Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings
Pages	302-313
Number of pages	12
Edition	PART 1
DOIs	https://doi.org/10.1007/978-3-642-31594-7_26
State	Published - 2012
Externally published	Yes
Event	39th International Colloquium on Automata, Languages, and Programming, ICALP 2012 - Warwick, United Kingdom Duration: 9 Jul 2012 → 13 Jul 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 1
Volume	7391 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	39th International Colloquium on Automata, Languages, and Programming, ICALP 2012
Country/Territory	United Kingdom
City	Warwick
Period	9/07/12 → 13/07/12

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-31594-7_26

Cite this

Emek, Y., Halldórsson, M. M., & Rosén, A. (2012). Space-constrained interval selection. In Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings (PART 1 ed., pp. 302-313). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7391 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-31594-7_26

@inproceedings{5e7394c4d6b946d98f5a000bd622a543,

title = "Space-constrained interval selection",

abstract = "We study streaming algorithms for the interval selection problem: finding a maximum cardinality subset of disjoint intervals on the line. A deterministic 2-approximation streaming algorithm for this problem is developed, together with an algorithm for the special case of proper intervals, achieving improved approximation ratio of 3/2. We complement these upper bounds by proving that they are essentially best possible in the streaming setting: it is shown that an approximation ratio of 2 - ε (or 3 / 2 - ε for proper intervals) cannot be achieved unless the space is linear in the input size. In passing, we also answer an open question of Adler and Azar [1] regarding the space complexity of constant-competitive randomized preemptive online algorithms for the same problem.",

author = "Yuval Emek and Halld{\'o}rsson, {Magn{\'u}s M.} and Adi Ros{\'e}n",

year = "2012",

doi = "10.1007/978-3-642-31594-7_26",

language = "אנגלית",

isbn = "9783642315930",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 1",

pages = "302--313",

booktitle = "Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings",

edition = "PART 1",

note = "39th International Colloquium on Automata, Languages, and Programming, ICALP 2012 ; Conference date: 09-07-2012 Through 13-07-2012",

}

Emek, Y, Halldórsson, MM & Rosén, A 2012, Space-constrained interval selection. in Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 7391 LNCS, pp. 302-313, 39th International Colloquium on Automata, Languages, and Programming, ICALP 2012, Warwick, United Kingdom, 9/07/12. https://doi.org/10.1007/978-3-642-31594-7_26

Space-constrained interval selection. / Emek, Yuval; Halldórsson, Magnús M.; Rosén, Adi.
Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings. PART 1. ed. 2012. p. 302-313 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7391 LNCS, No. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Space-constrained interval selection

AU - Emek, Yuval

AU - Halldórsson, Magnús M.

AU - Rosén, Adi

PY - 2012

Y1 - 2012

N2 - We study streaming algorithms for the interval selection problem: finding a maximum cardinality subset of disjoint intervals on the line. A deterministic 2-approximation streaming algorithm for this problem is developed, together with an algorithm for the special case of proper intervals, achieving improved approximation ratio of 3/2. We complement these upper bounds by proving that they are essentially best possible in the streaming setting: it is shown that an approximation ratio of 2 - ε (or 3 / 2 - ε for proper intervals) cannot be achieved unless the space is linear in the input size. In passing, we also answer an open question of Adler and Azar [1] regarding the space complexity of constant-competitive randomized preemptive online algorithms for the same problem.

AB - We study streaming algorithms for the interval selection problem: finding a maximum cardinality subset of disjoint intervals on the line. A deterministic 2-approximation streaming algorithm for this problem is developed, together with an algorithm for the special case of proper intervals, achieving improved approximation ratio of 3/2. We complement these upper bounds by proving that they are essentially best possible in the streaming setting: it is shown that an approximation ratio of 2 - ε (or 3 / 2 - ε for proper intervals) cannot be achieved unless the space is linear in the input size. In passing, we also answer an open question of Adler and Azar [1] regarding the space complexity of constant-competitive randomized preemptive online algorithms for the same problem.

UR - http://www.scopus.com/inward/record.url?scp=84883823142&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-31594-7_26

DO - 10.1007/978-3-642-31594-7_26

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84883823142

SN - 9783642315930

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 302

EP - 313

BT - Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings

T2 - 39th International Colloquium on Automata, Languages, and Programming, ICALP 2012

Y2 - 9 July 2012 through 13 July 2012

ER -

Emek Y, Halldórsson MM, Rosén A. Space-constrained interval selection. In Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings. PART 1 ed. 2012. p. 302-313. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). doi: 10.1007/978-3-642-31594-7_26

Space-constrained interval selection

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this