{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T06:52:16Z","timestamp":1672383136131},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,4,15]],"date-time":"2010-04-15T00:00:00Z","timestamp":1271289600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s00453-010-9406-0","type":"journal-article","created":{"date-parts":[[2010,4,14]],"date-time":"2010-04-14T16:13:13Z","timestamp":1271261593000},"page":"342-361","source":"Crossref","is-referenced-by-count":2,"title":["Approximation Algorithms for the Interval Constrained Coloring Problem"],"prefix":"10.1007","volume":"61","author":[{"given":"Ernst","family":"Althaus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Canzar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khaled","family":"Elbassioni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Karrenbauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juli\u00e1n","family":"Mestre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,4,15]]},"reference":[{"key":"9406_CR1","doi-asserted-by":"crossref","unstructured":"Althaus, E., Canzar, S., Emmett, M.R., Karrenbauer, A., Marshall, A.G., Meyer-Basese, A., Zhang, H.: Computing H\/D-exchange speeds of single residues from data of peptic fragments. In: Proceedings of the 23rd Annual ACM Symposium on Applied Computing, pp. 1273\u20131277 (2008)","DOI":"10.1145\/1363686.1363981"},{"key":"9406_CR2","doi-asserted-by":"crossref","unstructured":"Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Deconstructing intractability: a case study for interval constrained coloring. In: Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching, pp. 207\u2013220 (2009)","DOI":"10.1007\/978-3-642-02441-2_19"},{"key":"9406_CR3","unstructured":"Chang, J., Erlebach, T., Gailis, R., Khuller, S.: Broadcast scheduling: algorithms and complexity. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 473\u2013482 (2008)"},{"issue":"3","key":"9406_CR4","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/1147954.1147956","volume":"53","author":"R. Gandhi","year":"2006","unstructured":"Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding and its applications to approximation algorithms. J. ACM 53(3), 324\u2013360 (2006)","journal-title":"J. ACM"},{"key":"9406_CR5","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization\u2014Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization\u2014Polyhedra and Efficiency. Algorithms and Combinatorics, vol.\u00a024. Springer, Berlin (2003)"},{"key":"9406_CR6","doi-asserted-by":"crossref","unstructured":"Uno, T.: A fast algorithm for enumerating bipartite perfect matchings. In: Proceedings of the 12th International Conference Algorithms and Computation, pp. 367\u2013379 (2001)","DOI":"10.1007\/3-540-45678-3_32"},{"key":"9406_CR7","doi-asserted-by":"crossref","unstructured":"Elbassioni, K.M., Sitters, R., Zhang, Y.: A quasi-PTAS for profit-maximizing pricing on line graphs. In: Proceedings of the 15th Annual European Symposium on Algorithms, pp. 451\u2013462 (2007)","DOI":"10.1007\/978-3-540-75520-3_41"},{"key":"9406_CR8","unstructured":"Canzar, S.: Lagrangian relaxation\u2014solving NP-hard problems in computational biology via combinatorial optimization. PhD thesis, Universit\u00e4t des Saarlandes (2008)"},{"key":"9406_CR9","volume-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, a Guide to the Theory of NP-Completeness. Freeman, New York (1979)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9406-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9406-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9406-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:05Z","timestamp":1559137505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9406-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,15]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9406"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9406-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,15]]}}}