{"title":"A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines","authors":"S. Leonardi","doi":"10.1007/11671541_7","DOIUrl":"https://doi.org/10.1007/11671541_7","url":null,"abstract":"","PeriodicalId":254551,"journal":{"name":"Efficient Approximation and Online Algorithms","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121094616","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow","authors":"T. Erlebach","doi":"10.1007/11671541_4","DOIUrl":"https://doi.org/10.1007/11671541_4","url":null,"abstract":"","PeriodicalId":254551,"journal":{"name":"Efficient Approximation and Online Algorithms","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116211328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}