一类双目标超图截线问题的增量复杂度

{"title":"一类双目标超图截线问题的增量复杂度","authors":"Ricardo Andrade, E. Birmelé, A. Mary, Thomas Picchetti, M. Sagot","doi":"10.1007/978-3-319-22177-9_16","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Incremental Complexity of a Bi-objective Hypergraph Transversal Problem\",\"authors\":\"Ricardo Andrade, E. Birmelé, A. Mary, Thomas Picchetti, M. Sagot\",\"doi\":\"10.1007/978-3-319-22177-9_16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":335412,\"journal\":{\"name\":\"International Symposium on Fundamentals of Computation Theory\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Fundamentals of Computation Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-22177-9_16\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Fundamentals of Computation Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-22177-9_16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}