Pub Date : 2016-06-30DOI: 10.1007/978-3-319-39817-4_9
He Hong, Cao Boyan
{"title":"The Scheduling Strategy of Virtual Machine Migration Based on the Gray Forecasting Model","authors":"He Hong, Cao Boyan","doi":"10.1007/978-3-319-39817-4_9","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_9","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131588341","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}
Pub Date : 2016-06-30DOI: 10.1007/978-3-319-39817-4_21
E. Tomita, K. Yoshida, T. Hatta, A. Nagao, Hiro Ito, Mitsuo Wakatsuki
{"title":"A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique","authors":"E. Tomita, K. Yoshida, T. Hatta, A. Nagao, Hiro Ito, Mitsuo Wakatsuki","doi":"10.1007/978-3-319-39817-4_21","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_21","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121471331","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}
Pub Date : 2016-06-30DOI: 10.1007/978-3-319-39817-4_1
T. Erlebach
{"title":"Algorithms for Queryable Uncertainty","authors":"T. Erlebach","doi":"10.1007/978-3-319-39817-4_1","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_1","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132793809","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}
Pub Date : 2016-06-30DOI: 10.1007/978-3-319-39817-4_15
Jingjing Ma, Haitao Jiang
{"title":"Notes on the 6/5-Approximation Algorithm for One-Sided Scaffold Filling","authors":"Jingjing Ma, Haitao Jiang","doi":"10.1007/978-3-319-39817-4_15","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_15","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127072484","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}
Pub Date : 2016-06-30DOI: 10.1007/978-3-319-39817-4_5
Sandip Das, Ayan Nandy, Swami Sarvottamananda
{"title":"Linear Time Algorithm for 1-Center in Rd Under Convex Polyhedral Distance Function","authors":"Sandip Das, Ayan Nandy, Swami Sarvottamananda","doi":"10.1007/978-3-319-39817-4_5","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_5","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128691000","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}
Pub Date : 2016-06-30DOI: 10.1007/978-3-319-39817-4_7
Qilong Feng, Xiong Jiang, Jian-xin Wang
{"title":"Improved Algorithms for Several Parameterized Problems Based on Random Methods","authors":"Qilong Feng, Xiong Jiang, Jian-xin Wang","doi":"10.1007/978-3-319-39817-4_7","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_7","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"363 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134326236","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}
Pub Date : 2015-07-03DOI: 10.1007/978-3-319-19647-3_1
F. Fomin, Saket Saurabh, Neeldhara Misra
{"title":"Graph Modification Problems: A Modern Perspective","authors":"F. Fomin, Saket Saurabh, Neeldhara Misra","doi":"10.1007/978-3-319-19647-3_1","DOIUrl":"https://doi.org/10.1007/978-3-319-19647-3_1","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122533396","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}
Pub Date : 2015-07-03DOI: 10.1007/978-3-319-19647-3_22
Jinyan Wang, Minghao Yin, Jingli Wu
{"title":"Approximate Model Counting via Extension Rule","authors":"Jinyan Wang, Minghao Yin, Jingli Wu","doi":"10.1007/978-3-319-19647-3_22","DOIUrl":"https://doi.org/10.1007/978-3-319-19647-3_22","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131442066","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}
Pub Date : 2015-07-03DOI: 10.1007/978-3-319-19647-3_25
Aiyong Xian, Kaiyuan Zhu, Daming Zhu, Lianrong Pu
{"title":"Local Search to Approximate Max NAE- k k -Sat Tightly","authors":"Aiyong Xian, Kaiyuan Zhu, Daming Zhu, Lianrong Pu","doi":"10.1007/978-3-319-19647-3_25","DOIUrl":"https://doi.org/10.1007/978-3-319-19647-3_25","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132649062","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：