整数规划和关联树深度

{"title":"整数规划和关联树深度","authors":"E. Eiben, R. Ganian, D. Knop, S. Ordyniak, Michal Pilipczuk, Marcin Wrochna","doi":"10.1007/978-3-030-17953-3_15","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"435 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Integer Programming and Incidence Treedepth\",\"authors\":\"E. Eiben, R. Ganian, D. Knop, S. Ordyniak, Michal Pilipczuk, Marcin Wrochna\",\"doi\":\"10.1007/978-3-030-17953-3_15\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":421894,\"journal\":{\"name\":\"Conference on Integer Programming and Combinatorial Optimization\",\"volume\":\"435 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference on Integer Programming and Combinatorial Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-17953-3_15\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Integer Programming and Combinatorial Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-17953-3_15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}