区间约束着色问题的逼近

{"title":"区间约束着色问题的逼近","authors":"Ernst Althaus, S. Canzar, Khaled M. Elbassioni, A. Karrenbauer, Julián Mestre","doi":"10.1007/978-3-540-69903-3_20","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Approximating the Interval Constrained Coloring Problem\",\"authors\":\"Ernst Althaus, S. Canzar, Khaled M. Elbassioni, A. Karrenbauer, Julián Mestre\",\"doi\":\"10.1007/978-3-540-69903-3_20\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":447445,\"journal\":{\"name\":\"Scandinavian Workshop on Algorithm Theory\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scandinavian Workshop on Algorithm Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-540-69903-3_20\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scandinavian Workshop on Algorithm Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-540-69903-3_20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}