最小-最大和最大-最小资源共享问题的逼近算法及其应用

{"title":"最小-最大和最大-最小资源共享问题的逼近算法及其应用","authors":"K. Jansen","doi":"10.1007/11671541_6","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":254551,"journal":{"name":"Efficient Approximation and Online Algorithms","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications\",\"authors\":\"K. Jansen\",\"doi\":\"10.1007/11671541_6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":254551,\"journal\":{\"name\":\"Efficient Approximation and Online Algorithms\",\"volume\":\"100 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Efficient Approximation and Online Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/11671541_6\",\"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_6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}