{"title":"开放性问题专栏","authors":"W. Gasarch","doi":"10.1145/3604943.3604947","DOIUrl":null,"url":null,"abstract":"This Issue's Column! This issue's Open Problem Column is by Erika Melder. It is about lower bounds on approximating set cover. The overarching question is: are there easier proofs?","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Open Problems Column\",\"authors\":\"W. Gasarch\",\"doi\":\"10.1145/3604943.3604947\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This Issue's Column! This issue's Open Problem Column is by Erika Melder. It is about lower bounds on approximating set cover. The overarching question is: are there easier proofs?\",\"PeriodicalId\":387985,\"journal\":{\"name\":\"ACM SIGACT News\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM SIGACT News\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3604943.3604947\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM SIGACT News","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3604943.3604947","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This Issue's Column! This issue's Open Problem Column is by Erika Melder. It is about lower bounds on approximating set cover. The overarching question is: are there easier proofs?
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
