边不相交路径和不可分流的近似算法

{"title":"边不相交路径和不可分流的近似算法","authors":"T. Erlebach","doi":"10.1007/11671541_4","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":254551,"journal":{"name":"Efficient Approximation and Online Algorithms","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow\",\"authors\":\"T. Erlebach\",\"doi\":\"10.1007/11671541_4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":254551,\"journal\":{\"name\":\"Efficient Approximation and Online Algorithms\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Efficient Approximation and Online Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/11671541_4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Efficient Approximation and Online Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/11671541_4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}