{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:04:20Z","timestamp":1751634260151},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540412557"},{"type":"electronic","value":"9783540409960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40996-3_20","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:17:32Z","timestamp":1188350252000},"page":"228-240","source":"Crossref","is-referenced-by-count":10,"title":["Simple Algorithms for a Weighted Interval Selection Problem"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Erlebach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C.R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,1,29]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi.Complexity and Approximation. Combinatorial Optimization Problems and their ApproximabilityProperties. Springer, Berlin, 1999.","DOI":"10.1007\/978-3-642-58412-1"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. S. Naor, and B. Schieber. A unified approach toapproximating resource allocation and scheduling. In Proceedings of the 32nd Annual ACMSymposium on Theory of Computing STOC\u201900, pages 735\u2013744, 2000.","DOI":"10.1145\/335305.335410"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, S. Guha, J. S. Naor, and B. Schieber. Approximating the throughput of multiplemachines under real-time scheduling. In Proceedings of the 31st Annual ACM Symposiumon Theory of Computing STOC\u201999, pages 622\u2013631, 1999.","DOI":"10.1145\/301250.301420"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"P. Berman and B. DasGupta. Improvements in throughput maximization for real-time scheduling. In Proceedings of the 32nd Annual ACMSymposium on Theory of Computing STOC\u201900,pages 680\u2013687, 2000.","DOI":"10.1145\/335305.335401"},{"key":"20_CR5","unstructured":"P. Berman, Z. Zhang, J. Bouck, and W. Miller. Aligning two fragmented sequences. Manuscript,1999."},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0166-218X(93)E0174-W","volume":"59","author":"M. C. Carlisle","year":"1995","unstructured":"M. C. Carlisle and E. L. Lloyd. On the k-coloring of intervals. Discrete Appl. Math., 59:225\u2013235, 1995.","journal-title":"Discrete Appl. Math."},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/S0377-2217(96)00228-7","volume":"98","author":"Y. Crama","year":"1997","unstructured":"Y. Crama, O. Flippo, J. van de Klundert, and F. Spieksma. The assembly of printed circuitboards: a case with multiple machines and multiple board types. European Journal ofOperational Research, 98:457\u2013472, 1997.","journal-title":"European Journal ofOperational Research"},{"key":"20_CR8","unstructured":"T. Erlebach and F. Spieksma. Simple algorithms for a weighted interval scheduling problem.Technical Report M00-01, Department of Mathematics, Maastricht University, April 2000. http:\/\/www.tik.ee.ethz.ch\/_erlebach\/Report-M00-01.ps.gz ."},{"issue":"2","key":"20_CR9","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1006\/jagm.1999.1060","volume":"34","author":"S. A. Goldman","year":"2000","unstructured":"S. A. Goldman, J. Parwatikar, and S. Suri. Online scheduling with hard deadlines. Journalof Algorithms, 34(2):370\u2013389, 2000.","journal-title":"Journalof Algorithms"},{"key":"20_CR10","unstructured":"M. H. Goldwasser. Patience is a virtue: The effect of slack on competitiveness for admissioncontrol. In Proceedings of the 10th Annual ACM\u2010SIAM Symposium on Discrete AlgorithmsSODA\u201999, pages 396\u2013405, 1999."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"D. Hochbaum. Approximation algorithms for NP-hard problems. PWS Publishing Company,Boston, 1997.","DOI":"10.1145\/261342.571216"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<215::AID-JOS27>3.0.CO;2-Y","volume":"2","author":"F. Spieksma","year":"1999","unstructured":"F. Spieksma. Onthe approximability of an interval scheduling problem. Journal of Scheduling,2:215\u2013227, 1999.","journal-title":"Journal of Scheduling"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40996-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:26:02Z","timestamp":1556817962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40996-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540412557","9783540409960"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-40996-3_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}