{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T14:38:10Z","timestamp":1791211090493,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540404934","type":"print"},{"value":"9783540450610","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45061-0_59","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T11:54:04Z","timestamp":1184586844000},"page":"751-766","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Algorithmic Aspects of Bandwidth Trading"],"prefix":"10.1007","author":[{"given":"Randeep","family":"Bhatia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julia","family":"Chuzhoy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ari","family":"Freund","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joseph Seffi","family":"Naor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"59_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(87)90037-0","volume":"18","author":"E. M. Arkin","year":"1987","unstructured":"E. M. Arkin and E. B. Silverberg, Scheduling jobs with fixed start and end times. Discrete Applied Mathematics, Vol. 18, pp. 1\u20138, 1987.","journal-title":"Discrete Applied Mathematics"},{"key":"59_CR2","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1137\/S0097539799354138","volume":"31","author":"A. Bar-Noy","year":"2001","unstructured":"A. Bar-Noy, S. Guha, J. Naor, and B. Schieber, Approximating the throughput of multiple machines in real-time scheduling, SIAM Journal on Computing, Vol. 31 (2001), pp. 331\u2013352.","journal-title":"SIAM Journal on Computing"},{"key":"59_CR3","doi-asserted-by":"crossref","unstructured":"R. Bar-Yehuda, A. Bar-Noy, A. Freund, J. Naor, and B. Schieber, A unified approach To approximating resource allocation and scheduling, Proc. 32nd Annual ACM Symposium on Theory of Computing, pp. 735\u2013744, 2000.","DOI":"10.1145\/335305.335410"},{"key":"59_CR4","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1023\/A:1009822211065","volume":"4","author":"P. Berman","year":"2000","unstructured":"P. Berman and B. DasGupta, Multi-phase algorithms for throughput maximization for real-time scheduling. Journal of Combinatorial Optimization, Vol. 4, pp. 307\u2013323, 2000.","journal-title":"Journal of Combinatorial Optimization"},{"key":"59_CR5","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/0196-6774(81)90020-1","volume":"2","author":"R. Bar-Yehuda","year":"1981","unstructured":"R. Bar-Yehuda and S. Even, A linear time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms, Vol. 2, pp. 198\u2013203, 1981.","journal-title":"Journal of Algorithms"},{"key":"59_CR6","unstructured":"G. Cheliotis, Bandwidth Trading in the Real World: Findings and Implications for Commodities Brokerage. 3rd Berlin Internet Economics Workshop, 26\u201327 May 2000, Berlin."},{"key":"59_CR7","unstructured":"S. Chiu and J. P. Crametz, Surprising pricing relationships. Bandwidth Special Report, RISK. ENERGY & POWER RISK MANAGEMENT pages 12\u201314, July 2000. (http:\/\/www.riskwaters.com\/bandwidth)"},{"key":"59_CR8","doi-asserted-by":"crossref","unstructured":"J. Chuzhoy, R. Ostrovsky, Y. Rabani, Approximation algorithms for the job interval selection problem and related scheduling problems Proc. 42nd Annual Symposium of Foundations of Computer Science, pp. 348\u2013356, 2001.","DOI":"10.1109\/SFCS.2001.959909"},{"key":"59_CR9","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"M.R. Garey","year":"1980","unstructured":"M.R. Garey, D.S. Johnson, G.L. Miller and C.H. Papadimitriou, The complexity of coloring circular arcs and chords. SIAM Journal on Algebraic and Discrete Methods, Vol. 1, pp. 216\u2013227, 1980.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"59_CR10","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M. X. Goemans","year":"1995","unstructured":"M. X. Goemans and D. P. Williamson, A general approximation technique for constrained forest problems. SIAM J. on Computing, Vol. 24, pp. 296\u2013317, 1995.","journal-title":"SIAM J. on Computing"},{"key":"59_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0377-2217(94)90150-3","volume":"73","author":"K. Jansen","year":"1994","unstructured":"K. Jansen An approximation algorithm for the license and shift class design problem European Journal of Operational Research 73 pp. 127\u2013131, 1994.","journal-title":"European Journal of Operational Research"},{"issue":"5\u20136","key":"59_CR12","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S1389-1286(01)00186-4","volume":"36","author":"C. Kenyon","year":"2001","unstructured":"C. Kenyon and G. Cheliotis, Stochastic Models for Telecom Commoditiy Prices Computer Networks 36(5\u20136):533\u2013555, Theme Issue on Network Economics, Elsevier Science, 2001.","journal-title":"Computer Networks"},{"key":"59_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0377-2217(91)90320-U","volume":"54","author":"A. W. J. Kolen","year":"1991","unstructured":"A. W. J. Kolen and L. G. Kroon, On the computational complexity of (maximum) class scheduling, European Journal of Operational Research, Vol. 54, pp. 23\u201338, 1991.","journal-title":"European Journal of Operational Research"},{"key":"59_CR14","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0377-2217(93)90014-E","volume":"64","author":"A. W. J. Kolen","year":"1993","unstructured":"A. W. J. Kolen and L. G. Kroon, On the computational complexity of (maximum) shift scheduling, European Journal of Operational Research, Vol. 64, pp. 138\u2013151, 1993.","journal-title":"European Journal of Operational Research"},{"key":"59_CR15","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/0377-2217(94)90056-6","volume":"79","author":"A. W. J. Kolen","year":"1994","unstructured":"A. W. J. Kolen and L. G. Kroon, An analysis of shift class design problems, European Journal of Operational Research, Vol. 79, pp. 417\u2013430, 1994.","journal-title":"European Journal of Operational Research"},{"key":"59_CR16","unstructured":"A. W. J. Kolen and J. K. Lenstra, Combinatorics in operations research, Handbook of Combinatorics, Eds: R. L. Graham, M. Grotschel, and L. Lovasz, North Holland, 1995."},{"key":"59_CR17","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. C. R. Spieksma","year":"1999","unstructured":"F. C. R. Spieksma. On the approximability of an interval scheduling problem. Journal of Scheduling, Vol. 2 pp. 215\u2013227, 1999.","journal-title":"Journal of Scheduling"},{"key":"59_CR18","unstructured":"V. V. Vazirani. Approximation Algorithms. Springer-Verlag, 2001."},{"key":"59_CR19","unstructured":"http:\/\/www.zurich.ibm.com\/bandwidth\/concepts.html"},{"key":"59_CR20","unstructured":"P. Winkler and L. Zhang, Wavelength Assignment and Generalized Interval Graph Coloring, Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45061-0_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T19:33:46Z","timestamp":1558467226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45061-0_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404934","9783540450610"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45061-0_59","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"18 June 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}