{"title":"2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence","authors":"A. Kel'manov, S. Khamidullin, A. Panasenko","doi":"10.1007/978-3-030-40616-5_34","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":101827,"journal":{"name":"Numerical Computations: Theory and Algorithms","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Numerical Computations: Theory and Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-40616-5_34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
