Balanced splitting on weighted intervals
From MaRDI portal
Publication:1785388
DOI10.1016/j.orl.2015.05.005zbMath1408.90249MaRDI QIDQ1785388
Haitao Wang, Shimin Li, Jian Li, Wei Cao
Publication date: 28 September 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2015.05.005
algorithms; temporal databases; interval splitting; combinatorial optimizations; multi-version databases
90C27: Combinatorial optimization
Cites Work
- Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
- On the complexity of scheduling tasks with discrete starting times
- On the approximability of an interval scheduling problem
- Complexity results for scheduling tasks with discrete starting times
- Efficient array partitioning
- Approximation algorithms for array partitioning problems
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item