{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:51Z","timestamp":1725558951288},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245742"},{"type":"electronic","value":"9783540318330"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31833-0_19","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T14:11:05Z","timestamp":1278079865000},"page":"225-238","source":"Crossref","is-referenced-by-count":1,"title":["Joint Base Station Scheduling"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Erlebach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riko","family":"Jacob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mat\u00fa\u0161","family":"Miha\u013e\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Nunkesser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Szab\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes: A survey. In: SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia, PA (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Naor, S.: New hardness results for congestion minimization and machine scheduling. In: Proceedings of the 36th Annual ACM Symposium on the Theory of Computing (STOC 2004), pp. 28\u201334 (2004)","DOI":"10.1145\/1007352.1007364"},{"key":"19_CR3","first-page":"217","volume-title":"Proceedings of the 3rd IFIP International Conference on Theoretical Computer Science","author":"M. Cielibak","year":"2004","unstructured":"Cielibak, M., Erlebach, T., Hennecke, F., Weber, B., Widmayer, P.: Scheduling jobs on a minimum number of machines. In: Proceedings of the 3rd IFIP International Conference on Theoretical Computer Science, pp. 217\u2013230. Kluwer, Dordrecht (2004)"},{"key":"19_CR4","unstructured":"Das, S., Viswanathan, H., Rittenhouse, G.: Dynamic load balancing through coordinated scheduling in packet data systems. In: Proceedings of Infocom 2003 (2003)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Erlebach, T., Jacob, R., Miha\u013e\u00e1k, M., Nunkesser, M., Szab\u00f3, G., Widmayer, P.: Joint base station scheduling. Technical Report 461, ETH Z\u00fcrich, Institute of Theoretical Computer Science (2004)","DOI":"10.1007\/978-3-540-31833-0_19"},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0196-6774(02)00291-2","volume":"46","author":"T. Erlebach","year":"2001","unstructured":"Erlebach, T., Spieksma, F.C.R.: Interval selection: Applications, algorithms, and lower bounds. Algorithmica\u00a046, 27\u201353 (2001)","journal-title":"Algorithmica"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0166-218X(96)00013-3","volume":"74","author":"S. Felsner","year":"1997","unstructured":"Felsner, S., M\u00fcller, R., Wernisch, L.: Trapezoid graphs and generalizations, geometry and algorithms. Discrete Applied Mathematics\u00a074, 13\u201332 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, Freeman (1979)"},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/PL00009196","volume":"20","author":"A. Gr\u00e4f","year":"1998","unstructured":"Gr\u00e4f, A., Stumpf, M., Wei\u00dfenfels, G.: On coloring unit disk graphs. Algorithmica\u00a020(3), 277\u2013293 (1998)","journal-title":"Algorithmica"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica\u00a01, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"19_CR11","first-page":"1093","volume":"244","author":"L. Khachiyan","year":"1979","unstructured":"Khachiyan, L.: A polynomial algorithm in linear programming. Doklady Akademii Nauk SSSR\u00a0244, 1093\u20131096 (1979)","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"19_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.C.R. Spieksma","year":"1999","unstructured":"Spieksma, F.C.R.: On the approximability of an interval scheduling problem. Journal of Scheduling\u00a02, 215\u2013227 (1999)","journal-title":"Journal of Scheduling"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient Graph Representations. Field Institute Monographs. AMS\u00a019 (2003)","DOI":"10.1090\/fim\/019"},{"key":"19_CR14","volume-title":"Introduction to Graph Theory","author":"D. West","year":"2001","unstructured":"West, D.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Englewood Cliffs (2001)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31833-0_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:27:40Z","timestamp":1605742060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31833-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245742","9783540318330"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31833-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}