Interval scheduling maximizing minimum coverage

Show full item record



Permalink

http://hdl.handle.net/10138/307575

Citation

Mäkinen , V , Staneva , V , Tomescu , A I , Valenzuela , D & Wilzbach , S 2017 , ' Interval scheduling maximizing minimum coverage ' , Discrete Applied Mathematics , vol. 225 , pp. 130-135 . https://doi.org/10.1016/j.dam.2016.08.021

Title: Interval scheduling maximizing minimum coverage
Author: Mäkinen, Veli; Staneva, Valeria; Tomescu, Alexandru I.; Valenzuela, Daniel; Wilzbach, Sebastian
Contributor: University of Helsinki, Department of Computer Science
University of Helsinki, Department of Computer Science
University of Helsinki, Department of Computer Science
University of Helsinki, Department of Computer Science
Date: 2017-07-10
Language: eng
Number of pages: 6
Belongs to series: Discrete Applied Mathematics
ISSN: 0166-218X
URI: http://hdl.handle.net/10138/307575
Subject: Interval scheduling
Read pruning
Haplotype assembly
Max-flows
111 Mathematics
Rights:


Files in this item

Total number of downloads: Loading...

Files Size Format View
1508.07820.pdf 318.8Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record