SIGACT新闻在线算法专栏35:2019年审查中

SIGACT News Pub Date : 2019-12-04 DOI:10.1145/3374857.3374871

Felix Höhne, Sören Schmitt, R. V. Stee

{"title":"SIGACT新闻在线算法专栏35:2019年审查中","authors":"Felix Höhne, Sören Schmitt, R. V. Stee","doi":"10.1145/3374857.3374871","DOIUrl":null,"url":null,"abstract":"In this column, we will discuss some papers in online algorithms that appeared in 2019. As usual, we make no claim at complete coverage here, and have instead made a selection. If we have unaccountably missed your favorite paper and you would like to write about it or about any other topic in online algorithms, please don't hesitate to contact us!","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"SIGACT News Online Algorithms Column 35: 2019 in review\",\"authors\":\"Felix Höhne, Sören Schmitt, R. V. Stee\",\"doi\":\"10.1145/3374857.3374871\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this column, we will discuss some papers in online algorithms that appeared in 2019. As usual, we make no claim at complete coverage here, and have instead made a selection. If we have unaccountably missed your favorite paper and you would like to write about it or about any other topic in online algorithms, please don't hesitate to contact us!\",\"PeriodicalId\":22106,\"journal\":{\"name\":\"SIGACT News\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGACT News\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3374857.3374871\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGACT News","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3374857.3374871","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

在本专栏中，我们将讨论2019年出现的一些关于在线算法的论文。像往常一样，我们不按全险索赔，而是选择投保。如果我们莫名其妙地错过了您最喜欢的论文，并且您想写关于它或在线算法的任何其他主题，请不要犹豫与我们联系!

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

SIGACT News Online Algorithms Column 35: 2019 in review

In this column, we will discuss some papers in online algorithms that appeared in 2019. As usual, we make no claim at complete coverage here, and have instead made a selection. If we have unaccountably missed your favorite paper and you would like to write about it or about any other topic in online algorithms, please don't hesitate to contact us!

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

SIGACT News

自引率

0.00%

发文量