{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:51:47Z","timestamp":1725486707766},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679967"},{"type":"electronic","value":"9783540444367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44436-x_7","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T05:33:14Z","timestamp":1182144794000},"page":"51-59","source":"Crossref","is-referenced-by-count":0,"title":["Variable Length Sequencing with Two Lengths"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junichiro","family":"Fukuyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., R. Bar-Yehuda, A. Freund, J. Naor and B. Schieber, A Unified Approach to Approximating Resource Allocation and Scheduling, Proc.3 2-nd STOC, 2000.","key":"7_CR1","DOI":"10.1145\/335305.335410"},{"doi-asserted-by":"crossref","unstructured":"Bar-Noy A., S. Guha, J.(S.) Naor and B.S chieber, Approximating the throughput of multiple machines in real-time scheduling, Proc.31st ACM STOC, 622\u2013631, 1999.","key":"7_CR2","DOI":"10.1145\/301250.301420"},{"doi-asserted-by":"crossref","unstructured":"Berman P. and B. DasGupta, Improvements in Throughput Maximization for Real-Time Scheduling Proc.32-nd STOC, 2000.","key":"7_CR3","DOI":"10.1145\/335305.335401"},{"key":"7_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-48523-6_17","volume-title":"ICALP\u201998","author":"P. Berman","year":"1999","unstructured":"Berman P., M. Karpinski, On some tighter inapproximability results, ICALP\u201998, Springer-Verlag LNCS 1644, 200\u2013209, July 1999."},{"key":"7_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/3-540-48447-7_30","volume-title":"Efficient Web Searching Using Temporal Factors","author":"A. Czumaj","year":"1999","unstructured":"Czumaj A., I. F inch, L Gasieniec, A. Gibbons, P. Leng, W. Rytter and M. Zito, Efficient Web Searching Using Temporal Factors, Proc.WADS\u201999, Springer-Verlag LNCS 1663, 294\u2013305, August 1999."},{"key":"7_CR6","series-title":"Lect Notes Comput Sci","first-page":"215","volume-title":"Journal of Scheduling","author":"F.C.R. Spieksma","year":"1999","unstructured":"Spieksma, F.C.R., On the approximability of an interval scheduling problem, Journal of Scheduling 2, 215\u2013227, 1999 (preliminary version in the Proceedings of the APPROX\u201998 Conference, Lecture Notes in Computer Science, 1444, 169\u2013180, 1998)."}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44436-X_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T23:55:10Z","timestamp":1556495710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44436-X_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679967","9783540444367"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-44436-x_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}