Simple Algorithms for a Weighted Interval Selection Problem
暂无分享,去创建一个
[1] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[2] Errol L. Lloyd,et al. on the K-coloring of Intervals , 1991, Discret. Appl. Math..
[3] Piotr Berman,et al. Aligning two fragmented sequences , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.
[4] O. E. Flippo,et al. The assembly of printed circuit boards : a case with multiple machines and multiple board types , 1995 .
[5] Reuven Bar-Yehuda,et al. A unified approach to approximating resource allocation and scheduling , 2001, JACM.
[6] Michael H. Goldwasser. Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control , 1999, SODA '99.
[7] P. Berman,et al. Improvements in Throughput Maximization for Real-Time Scheduling , 1999 .
[8] F. Spieksma. On the approximability of an interval scheduling problem , 1999 .
[9] Errol L. Lloyd,et al. On the k -coloring of intervals , 1995 .
[10] Frits C. R. Spieksma,et al. The assembly of printed circuit boards: A case with multiple machines and multiple board types , 1997 .
[11] Piotr Berman,et al. Improvements in throughout maximization for real-time scheduling , 2000, STOC '00.
[12] Subhash Suri,et al. Online Scheduling with Hard Deadlines , 2000, J. Algorithms.
[13] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.
[14] Giorgio Gambosi,et al. Complexity and Approximation , 1999, Springer Berlin Heidelberg.
[15] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .
[16] Sudipto Guha,et al. Approximating the throughput of multiple machines under real-time scheduling , 1999, STOC '99.