{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:41:02Z","timestamp":1725489662537},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401551"},{"type":"electronic","value":"9783540448396"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44839-x_28","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T09:23:05Z","timestamp":1187256185000},"page":"254-262","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling Intervals Using Independent Sets in Claw-Free Graphs"],"prefix":"10.1007","author":[{"given":"Daya Ram","family":"Gaur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramesh","family":"Krishnamurti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"M.-C. Cai, X. Deng, and L. Wang. Approximate sequencing for variable length tasks. Theoretical Computer Science (to appear).","DOI":"10.1016\/S0304-3975(02)00091-9"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/S0304-3975(00)00366-2","volume":"262","author":"A. Czumaj","year":"2001","unstructured":"A. Czumaj, I. Finch, L. Gasieniec, A. Gibbons and P. Leng, W. Rytter and M. Zito, \u2018Efficient Web Searching Using Temporal Factors\u2019, Theoretical Computer Science, 262 (2001), pp. 569\u2013582.","journal-title":"Theoretical Computer Science"},{"key":"28_CR3","unstructured":"A. Czumaj, L. Gasieniec, D. Gaur, R. Krishnamurti, W. Rytter and M. Zito, \u2018(NOTE) On polynomial time approximation algorithms for the variable length scheduling problem\u2019, Theoretical Computer Science (to appear)."},{"key":"28_CR4","unstructured":"M. Halld\u00f3rsson, \u2018Approximating Discrete Collections via Local Improvements\u2019, ACM-SIAM Symposium on Discrete Algorithms, (1995) 160\u2013169."},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0167-6377(92)90087-J","volume":"12","author":"J. M. Keil","year":"1992","unstructured":"J. M. Keil, \u2018On the complexity of scheduling tasks with discrete starting times\u2019, Operations Research Letters, 12 (1992) 293\u2013295.","journal-title":"Operations Research Letters"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"G.J. Minty","year":"1980","unstructured":"G.J. Minty, \u2018On maximal independent sets of vertices in claw-free graphs\u2019, J. Combin. Theory Ser. B, 28 (1980) 284\u2013304.","journal-title":"J. Combin. Theory Ser. B"},{"key":"28_CR7","unstructured":"L. Lovasz and M. D. Plummer, \u2018Matching Theory\u2019, North Holland, Amsterdam (1986)."},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/0196-6774(82)90030-X","volume":"3","author":"K. Nakajima","year":"1982","unstructured":"K. Nakajima and S. L. Hakimi, \u2018Complexity results for scheduling tasks with discrete starting times\u2019, Journal of Algorithms, 3 (1982) 344\u2013361.","journal-title":"Journal of Algorithms"},{"key":"28_CR9","unstructured":"D. Nakamura and A. Tamura, \u2018A revision of Minty\u2019s algorithm for finding a maximum weight stable set of a claw-free graph\u2019, Technical Report RIMS: 1261 Research Institute for Mathematical Sciences, Kyoto University."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","volume":"29","author":"N. Sbihi","year":"1980","unstructured":"N. Sbihi, \u2018Algorithme de recherche d\u2019un stable de cardinalit\u2019e maximum dans un graphe sans\u2019 etoile\u2019, Discrete Math.\n                           29, (1980) pp. 53\u201376 (in French).","journal-title":"Discrete Math."},{"key":"28_CR11","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, \u2018On the approximability of an interval scheduling problem\u2019, Journal of Scheduling, 2, (1999) 215\u2013227.","journal-title":"Journal of Scheduling"},{"key":"28_CR12","unstructured":"F. C. R. Spieksma and Y. Crama, \u2018The complexity of scheduling short tasks with few starting times\u2019, Research Report M92-06, Department of Mathematics, Maastricht University, (1992)."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2014 ICCSA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44839-X_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T22:43:41Z","timestamp":1550789021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44839-X_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401551","9783540448396"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44839-x_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}