{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T20:24:59Z","timestamp":1764102299163},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0196-6774(02)00291-2","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T18:57:26Z","timestamp":1045508246000},"page":"27-53","source":"Crossref","is-referenced-by-count":37,"title":["Interval selection: Applications, algorithms, and lower bounds"],"prefix":"10.1016","volume":"46","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":"78","reference":[{"key":"10.1016\/S0196-6774(02)00291-2_BIB001","series-title":"Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties","author":"Ausiello","year":"1999"},{"issue":"5","key":"10.1016\/S0196-6774(02)00291-2_BIB002","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1145\/502102.502107","article-title":"A unified approach to approximating resource allocation and scheduling","volume":"48","author":"Bar-Noy","year":"2001","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0196-6774(02)00291-2_BIB003","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/S0097539799354138","article-title":"Approximating the throughput of multiple machines in real-time scheduling","volume":"31","author":"Bar-Noy","year":"2001","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(02)00291-2_BIB004","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1023\/A:1009822211065","article-title":"Multi-phase algorithms for throughput maximization for real-time scheduling","volume":"4","author":"Berman","year":"2000","journal-title":"J. Comb. Optim."},{"key":"10.1016\/S0196-6774(02)00291-2_BIB005","series-title":"Online Computation and Competitive Analysis","author":"Borodin","year":"1998"},{"issue":"4","key":"10.1016\/S0196-6774(02)00291-2_BIB006","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1137\/S0097539795283292","article-title":"Bounding the power of preemption in randomized scheduling","volume":"27","author":"Canetti","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(02)00291-2_BIB007","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0166-218X(95)80003-M","article-title":"On the k-coloring of intervals","volume":"59","author":"Carlisle","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0196-6774(02)00291-2_BIB008","series-title":"Proc. 42nd Ann. Symp. on Foundations of Computer Science, FOCS'01","article-title":"Approximation algorithms for the job interval selection problem and related scheduling problems","author":"Chuzhoy","year":"2001"},{"key":"10.1016\/S0196-6774(02)00291-2_BIB009","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0377-2217(96)00228-7","article-title":"The assembly of printed circuit boards: a case with multiple machines and multiple board types","volume":"98","author":"Crama","year":"1997","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0196-6774(02)00291-2_BIB010","unstructured":"T. Erlebach, F. Spieksma, Interval selection: Applications, algorithms, and lower bounds, TIK-Report 152, Computer Engineering and Networks Laboratory, ETH Zurich, October 2002"},{"key":"10.1016\/S0196-6774(02)00291-2_BIB011","doi-asserted-by":"crossref","first-page":"S96","DOI":"10.1287\/opre.40.1.S96","article-title":"Approximation algorithms for fixed job schedule problems","volume":"40","author":"Fischetti","year":"1992","journal-title":"Oper. Res."},{"key":"10.1016\/S0196-6774(02)00291-2_BIB012","series-title":"Proc. 5th British Combinatorial Conference","first-page":"211","article-title":"Some polynomial algorithms for certain graphs and hypergraphs","author":"Frank","year":"1975"},{"issue":"3","key":"10.1016\/S0196-6774(02)00291-2_BIB013","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/S0022-0000(05)80064-9","article-title":"Trans-dichotomous algorithms for minimum spanning trees and shortest paths","volume":"48","author":"Fredman","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0196-6774(02)00291-2_BIB014","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear-time algorithm for a special case of disjoint set union","volume":"30","author":"Gabow","year":"1985","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/S0196-6774(02)00291-2_BIB015","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1006\/jagm.1999.1060","article-title":"Online scheduling with hard deadlines","volume":"34","author":"Goldman","year":"2000","journal-title":"J. Algorithms"},{"key":"10.1016\/S0196-6774(02)00291-2_BIB016","series-title":"Proc. 10th Ann. ACM\u2013SIAM Symp. on Discrete Algorithms, SODA'99","first-page":"396","article-title":"Patience is a virtue: The effect of slack on competitiveness for admission control","author":"Goldwasser","year":"1999"},{"key":"10.1016\/S0196-6774(02)00291-2_BIB017","series-title":"Approximation Algorithms for NP-hard Problems","author":"Hochbaum","year":"1997"},{"issue":"1","key":"10.1016\/S0196-6774(02)00291-2_BIB018","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1009940607600","article-title":"Optimization in electronic markets: Examples in combinatorial auctions","volume":"3","author":"Hoesel","year":"2001","journal-title":"Netnomics"},{"key":"10.1016\/S0196-6774(02)00291-2_BIB019","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1287\/opre.45.4.624","article-title":"Exact and approximation algorithms for the tactical fixed interval scheduling problem","volume":"45","author":"Kroon","year":"1997","journal-title":"Oper. Res."},{"key":"10.1016\/S0196-6774(02)00291-2_BIB020","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"key":"10.1016\/S0196-6774(02)00291-2_BIB021","series-title":"Proc. 4th Ann. European Symp. on Algorithms, ESA'96","first-page":"121","article-title":"Priority queues: Small, monotone and trans-dichotomous","volume":"1136","author":"Raman","year":"1996"},{"key":"10.1016\/S0196-6774(02)00291-2_BIB022","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","article-title":"Computationally manageable combinational auctions","volume":"44","author":"Rothkopf","year":"1998","journal-title":"Manag. Sci."},{"key":"10.1016\/S0196-6774(02)00291-2_BIB023","unstructured":"A. Seznec, A new case for skewed-associativity, Technical Report RR-3208, INRIA, Rennes, France, July 1997"},{"key":"10.1016\/S0196-6774(02)00291-2_BIB024","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<215::AID-JOS27>3.0.CO;2-Y","article-title":"On the approximability of an interval scheduling problem","volume":"2","author":"Spieksma","year":"1999","journal-title":"J. Sched."},{"key":"10.1016\/S0196-6774(02)00291-2_BIB025","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1145\/316542.316548","article-title":"Undirected single-source shortest paths with positive integer weights in linear time","volume":"46","author":"Thorup","year":"1999","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0196-6774(02)00291-2_BIB026","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/PL00009192","article-title":"A unified analysis of paging and caching","volume":"20","author":"Torng","year":"1998","journal-title":"Algorithmica"},{"key":"10.1016\/S0196-6774(02)00291-2_BIB027","article-title":"Aligning two fragmented sequences","author":"Veeramachaneni","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0196-6774(02)00291-2_BIB028","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0304-3975(94)90150-3","article-title":"On-line scheduling of jobs with fixed start and end times","volume":"130","author":"Woeginger","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0196-6774(02)00291-2_BIB029","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(87)90107-4","article-title":"The maximum k-colorable subgraph problem for chordal graphs","volume":"24","author":"Yannakakis","year":"1987","journal-title":"Inform. Process. Lett."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677402002912?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677402002912?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T09:27:05Z","timestamp":1553938025000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677402002912"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0196677402002912"],"URL":"https:\/\/doi.org\/10.1016\/s0196-6774(02)00291-2","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}