发布求助
文献互助 智能选刊 最新文献

Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)最新文献

筛选
英文 中文
Front Matter, Table of Contents, Preface, Conference Organization 前文，目录，序言，会议组织
Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2018-08-13 DOI: 10.4230/OASIcs.SOSA.2018.0
S. Schewe, Lijun Zhang
{"title":"Front Matter, Table of Contents, Preface, Conference Organization","authors":"S. Schewe, Lijun Zhang","doi":"10.4230/OASIcs.SOSA.2018.0","DOIUrl":"https://doi.org/10.4230/OASIcs.SOSA.2018.0","url":null,"abstract":"","PeriodicalId":93491,"journal":{"name":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","volume":"13 1","pages":"0:1-0:20"},"PeriodicalIF":0.0,"publicationDate":"2018-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85214648","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}
引用次数: 1
Asymmetric Convex Intersection Testing 非对称凸交测试
Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2018-08-01 DOI: 10.4230/OASIcs.SOSA.2019.9
Luis Barba, Wolfgang Mulzer
{"title":"Asymmetric Convex Intersection Testing","authors":"Luis Barba, Wolfgang Mulzer","doi":"10.4230/OASIcs.SOSA.2019.9","DOIUrl":"https://doi.org/10.4230/OASIcs.SOSA.2019.9","url":null,"abstract":"We consider asymmetric convex intersection testing (ACIT). \u0000Let $P subset mathbb{R}^d$ be a set of $n$ points and $mathcal{H}$ a set of $n$ halfspaces in $d$ dimensions. We denote by $text{ch}(P)$ the polytope obtained by taking the convex hull of $P$, and by $text{fh}(mathcal{H})$ the polytope obtained by taking the intersection of the halfspaces in $mathcal{H}$. Our goal is to decide whether the intersection of $mathcal{H}$ and the convex hull of $P$ are disjoint. Even though ACIT is a natural variant of classic LP-type problems that have been studied at length in the literature, and despite its applications in the analysis of high-dimensional data sets, it appears that the problem has not been studied before. \u0000We discuss how known approaches can be used to attack the ACIT problem, and we provide a very simple strategy that leads to a deterministic algorithm, linear on $n$ and $m$, whose running time depends reasonably on the dimension $d$.","PeriodicalId":93491,"journal":{"name":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","volume":"19 1","pages":"9:1-9:14"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90856169","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}
引用次数: 1
A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum 子集和的一个简单的近线性伪多项式时间随机化算法
Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2018-07-30 DOI: 10.4230/OASIcs.SOSA.2019.17
Ce Jin, Hongxun Wu
{"title":"A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum","authors":"Ce Jin, Hongxun Wu","doi":"10.4230/OASIcs.SOSA.2019.17","DOIUrl":"https://doi.org/10.4230/OASIcs.SOSA.2019.17","url":null,"abstract":"Given a multiset S of n positive integers and a target integer t, the Subset Sum problem asks to determine whether there exists a subset of S that sums up to t. The current best deterministic algorithm, by Koiliaris and Xu [SODA'17], runs in O~(sqrt{n}t) time, where O~ hides poly-logarithm factors. Bringmann [SODA'17] later gave a randomized O~(n + t) time algorithm using two-stage color-coding. The O~(n+t) running time is believed to be near-optimal.\u0000In this paper, we present a simple and elegant randomized algorithm for Subset Sum in O~(n + t) time. Our new algorithm actually solves its counting version modulo prime p>t, by manipulating generating functions using FFT.","PeriodicalId":93491,"journal":{"name":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","volume":"34 1","pages":"17:1-17:6"},"PeriodicalIF":0.0,"publicationDate":"2018-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82446050","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}
引用次数: 28
A Framework for Searching in Graphs in the Presence of Errors 图中存在错误的搜索框架
Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2018-04-01 DOI: 10.4230/OASIcs.SOSA.2019.4
D. Dereniowski, Daniel Graf, Stefan Tiegel, Przemyslaw Uzna'nski
{"title":"A Framework for Searching in Graphs in the Presence of Errors","authors":"D. Dereniowski, Daniel Graf, Stefan Tiegel, Przemyslaw Uzna'nski","doi":"10.4230/OASIcs.SOSA.2019.4","DOIUrl":"https://doi.org/10.4230/OASIcs.SOSA.2019.4","url":null,"abstract":"We consider the problem of searching for an unknown target vertex $t$ in a (possibly edge-weighted) graph. Each emph{vertex-query} points to a vertex $v$ and the response either admits $v$ is the target or provides any neighbor $snot=v$ that lies on a shortest path from $v$ to $t$. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide algorithms for the error-less case and for the independent noise model (where each query independently receives an erroneous answer with known probability $p<1/2$ and a correct one with probability $1-p$). \u0000We study this problem in both adversarial errors and independent noise models. First, we show an algorithm that needs $frac{log_2 n}{1 - H(r)}$ queries against emph{adversarial} errors, where adversary is bounded with its rate of errors by a known constant $r<1/2$. Our algorithm is in fact a simplification of previous work, and our refinement lies in invoking amortization argument. We then show that our algorithm coupled with Chernoff bound argument leads to an algorithm for independent noise that is simpler and with a query complexity that is both simpler and asymptotically better to one of Emamjomeh-Zadeh et al. [STOC 2016]. \u0000Our approach has a wide range of applications. First, it improves and simplifies Robust Interactive Learning framework proposed by Emamjomeh-Zadeh et al. [NIPS 2017]. Secondly, performing analogous analysis for emph{edge-queries} (where query to edge $e$ returns its endpoint that is closer to target) we actually recover (as a special case) noisy binary search algorithm that is asymptotically optimal, matching the complexity of Feige et al. [SIAM J. Comput. 1994]. Thirdly, we improve and simplify upon existing algorithm for searching of emph{unbounded} domains due to Aslam and Dhagat [STOC 1991].","PeriodicalId":93491,"journal":{"name":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","volume":"6 1","pages":"4:1-4:17"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73581810","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}
引用次数: 17
Selection from heaps, row-sorted matrices and X+Y using soft heaps 选择从堆，行排序矩阵和X+Y使用软堆
Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2018-02-20 DOI: 10.4230/OASIcs.SOSA.2019.5
Haim Kaplan, L. Kozma, Or Zamir, Uri Zwick
{"title":"Selection from heaps, row-sorted matrices and X+Y using soft heaps","authors":"Haim Kaplan, L. Kozma, Or Zamir, Uri Zwick","doi":"10.4230/OASIcs.SOSA.2019.5","DOIUrl":"https://doi.org/10.4230/OASIcs.SOSA.2019.5","url":null,"abstract":"We use soft heaps to obtain simpler optimal algorithms for selecting the $k$-th smallest item, and the set of~$k$ smallest items, from a heap-ordered tree, from a collection of sorted lists, and from $X+Y$, where $X$ and $Y$ are two unsorted sets. Our results match, and in some ways extend and improve, classical results of Frederickson (1993) and Frederickson and Johnson (1982). In particular, for selecting the $k$-th smallest item, or the set of~$k$ smallest items, from a collection of~$m$ sorted lists we obtain a new optimal \"output-sensitive\" algorithm that performs only $O(m+sum_{i=1}^m log(k_i+1))$ comparisons, where $k_i$ is the number of items of the $i$-th list that belong to the overall set of~$k$ smallest items.","PeriodicalId":93491,"journal":{"name":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","volume":"152 1","pages":"5:1-5:21"},"PeriodicalIF":0.0,"publicationDate":"2018-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86176374","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}
引用次数: 23
A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance 一种近似文本到模式汉明距离的简单算法
Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2018-01-01 DOI: 10.4230/OASIcs.SOSA.2018.10
T. Kopelowitz, E. Porat
{"title":"A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance","authors":"T. Kopelowitz, E. Porat","doi":"10.4230/OASIcs.SOSA.2018.10","DOIUrl":"https://doi.org/10.4230/OASIcs.SOSA.2018.10","url":null,"abstract":"The algorithmic task of computing the Hamming distance between a given pattern of length m and each location in a text of length n, both over a general alphabet Sigma, is one of the most fundamental algorithmic tasks in string algorithms. The fastest known runtime for exact computation is tilde O(nsqrt m). We recently introduced a complicated randomized algorithm for obtaining a (1 +/- eps) approximation for each location in the text in O( (n/eps) log(1/eps) log n log m log |Sigma|) total time, breaking a barrier that stood for 22 years. In this paper, we introduce an elementary and simple randomized algorithm that takes O((n/eps) log n log m) time.","PeriodicalId":93491,"journal":{"name":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","volume":"20 1","pages":"10:1-10:5"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77102732","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}
引用次数: 19
Approximation Schemes for 0-1 Knapsack 0-1背包的近似格式
Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2018-01-01 DOI: 10.4230/OASIcs.SOSA.2018.5
Timothy M. Chan
{"title":"Approximation Schemes for 0-1 Knapsack","authors":"Timothy M. Chan","doi":"10.4230/OASIcs.SOSA.2018.5","DOIUrl":"https://doi.org/10.4230/OASIcs.SOSA.2018.5","url":null,"abstract":"We revisit the standard 0-1 knapsack problem. The latest polynomial-time approximation scheme by Rhee (2015) with approximation factor 1+eps has running time near O(n+(1/eps)^{5/2}) (ignoring polylogarithmic factors), and is randomized. We present a simpler algorithm which achieves the same result and is deterministic. With more effort, our ideas can actually lead to an improved time bound near O(n + (1/eps)^{12/5}), and still further improvements for small n.","PeriodicalId":93491,"journal":{"name":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","volume":"43 1","pages":"5:1-5:12"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86937933","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}
引用次数: 40
Simple and Efficient Leader Election 简单有效的领导人选举
Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2018-01-01 DOI: 10.4230/OASIcs.SOSA.2018.9
P. Berenbrink, Dominik Kaaser, Peter Kling, Lena Otterbach
{"title":"Simple and Efficient Leader Election","authors":"P. Berenbrink, Dominik Kaaser, Peter Kling, Lena Otterbach","doi":"10.4230/OASIcs.SOSA.2018.9","DOIUrl":"https://doi.org/10.4230/OASIcs.SOSA.2018.9","url":null,"abstract":"We provide a simple and efficient population protocol for leader election that uses O(log n) states and elects exactly one leader in O(n (log n)^2) interactions with high probability and in expectation. Our analysis is simple and based on fundamental stochastic arguments. Our protocol combines the tournament based leader elimination by Alistarh and Gelashvili, ICALP'15, with the synthetic coin introduced by Alistarh et al., SODA'17.","PeriodicalId":93491,"journal":{"name":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","volume":"1 1","pages":"9:1-9:11"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90094080","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}
引用次数: 34
Simple Analyses of the Sparse Johnson-Lindenstrauss Transform 稀疏Johnson-Lindenstrauss变换的简单分析
Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2018-01-01 DOI: 10.4230/OASIcs.SOSA.2018.15
Michael B. Cohen, T. S. Jayram, Jelani Nelson
{"title":"Simple Analyses of the Sparse Johnson-Lindenstrauss Transform","authors":"Michael B. Cohen, T. S. Jayram, Jelani Nelson","doi":"10.4230/OASIcs.SOSA.2018.15","DOIUrl":"https://doi.org/10.4230/OASIcs.SOSA.2018.15","url":null,"abstract":"For every n-point subset X of Euclidean space and target distortion 1+eps for 0 l_2^m where f(x) = Ax for A a matrix with m rows where (1) m = O((log n)/eps^2), and (2) each column of A is sparse, having only O(eps m) non-zero entries. Though the constructions given for such A in (Kane, Nelson, J. ACM 2014) are simple, the analyses are not, employing intricate combinatorial arguments. We here give two simple alternative proofs of their main result, involving no delicate combinatorics. One of these proofs has already been tested pedagogically, requiring slightly under forty minutes by the third author at a casual pace to cover all details in a blackboard course lecture.","PeriodicalId":93491,"journal":{"name":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","volume":"37 1","pages":"15:1-15:9"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91195833","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}
引用次数: 39
Congestion Minimization for Multipath Routing via Multiroute Flows 基于多路由流的多路径路由拥塞最小化
Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2018-01-01 DOI: 10.4230/OASIcs.SOSA.2018.3
C. Chekuri, Mark Idleman
{"title":"Congestion Minimization for Multipath Routing via Multiroute Flows","authors":"C. Chekuri, Mark Idleman","doi":"10.4230/OASIcs.SOSA.2018.3","DOIUrl":"https://doi.org/10.4230/OASIcs.SOSA.2018.3","url":null,"abstract":"Congestion minimization is a well-known routing problem for which there is an O(log n/loglog n)-approximation via randomized rounding due to Raghavan and Thompson. Srinivasan formally introduced the low-congestion multi-path routing problem as a generalization of the (single-path) congestion minimization problem. The goal is to route multiple disjoint paths for each pair, for the sake of fault tolerance. Srinivasan developed a dependent randomized scheme for a special case of the multi-path problem when the input consists of a given set of disjoint paths for each pair and the goal is to select a given subset of them. Subsequently Doerr gave a different dependentrounding scheme and derandomization. Doerr et al. considered the problem where the paths have to be chosen, and applied the dependent rounding technique and evaluated it experimentally. However, their algorithm does not maintain the required disjointness property without which the problem easily reduces to the standard congestion minimization problem. In this note we show a simple algorithm that solves the problem correctly without the need for dependent rounding --- standard independent rounding suffices. This is made possible via the notion of multiroute flows originally suggested by Kishimoto et al. One advantage of the simpler rounding is an improved bound on the congestion when the path lengths are short.","PeriodicalId":93491,"journal":{"name":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","volume":"138 1","pages":"3:1-3:12"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74695503","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}
引用次数: 2
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信