Interval scheduling maximizing minimum coverage

DOI10.1016/j.dam.2016.08.021zbMath1370.68040arXiv1508.07820OpenAlexW2962935915MaRDI QIDQ528573

Daniel Valenzuela, Veli Mäkinen, Sebastian Wilzbach, Valeria Staneva, Alexandru I. Tomescu

Publication date: 12 May 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.07820

zbMATH Keywords

interval schedulinghaplotype assemblymax-flowsread pruning

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Protein sequences, DNA sequences (92D20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items

Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times

Uses Software

• WhatsHap

Cites Work

• Unnamed Item
• Unnamed Item
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Scheduling jobs with fixed start and end times
• The \(k\)-track assignment problem
• Interval scheduling on identical machines
• Maximal Flow Through a Network
• Interval scheduling: A survey
• An Optimal Solution for the Channel-Assignment Problem
• Max flows in O(nm) time, or better