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

Splay Top Trees 斜顶树

Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2022-10-21 DOI: 10.1137/1.9781611977585.ch28

J. Holm, E. Rotenberg, Alice Ryhl

引用次数: 2

Capacitated Vehicle Routing in Graphic Metrics 基于图形度量的车辆路径控制

Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2022-10-18 DOI: 10.48550/arXiv.2210.09806

Tobias Mömke, Hang Zhou

引用次数: 4

A Simple Framework for Finding Balanced Sparse Cuts via APSP 一种基于APSP的寻找平衡稀疏切的简单框架

Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2022-09-19 DOI: 10.48550/arXiv.2209.08845

L. Chen, Rasmus Kyng, M. Gutenberg, Sushant Sachdeva

{"title":"A Simple Framework for Finding Balanced Sparse Cuts via APSP","authors":"L. Chen, Rasmus Kyng, M. Gutenberg, Sushant Sachdeva","doi":"10.48550/arXiv.2209.08845","DOIUrl":"https://doi.org/10.48550/arXiv.2209.08845","url":null,"abstract":"We present a very simple and intuitive algorithm to find balanced sparse cuts in a graph via shortest-paths. Our algorithm combines a new multiplicative-weights framework for solving unit-weight multi-commodity flows with standard ball growing arguments. Using Dijkstra's algorithm for computing the shortest paths afresh every time gives a very simple algorithm that runs in time $widetilde{O}(m^2/phi)$ and finds an $widetilde{O}(phi)$-sparse balanced cut, when the given graph has a $phi$-sparse balanced cut. Combining our algorithm with known deterministic data-structures for answering approximate All Pairs Shortest Paths (APSP) queries under increasing edge weights (decremental setting), we obtain a simple deterministic algorithm that finds $m^{o(1)}phi$-sparse balanced cuts in $m^{1+o(1)}/phi$ time. Our deterministic almost-linear time algorithm matches the state-of-the-art in randomized and deterministic settings up to subpolynomial factors, while being significantly simpler to understand and analyze, especially compared to the only almost-linear time deterministic algorithm, a recent breakthrough by Chuzhoy-Gao-Li-Nanongkai-Peng-Saranurak (FOCS 2020).","PeriodicalId":93491,"journal":{"name":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","volume":"29 1","pages":"42-55"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89819007","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

An EPTAS for Budgeted Matroid Independent Set 预算矩阵独立集的EPTAS

Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2022-09-10 DOI: 10.48550/arXiv.2209.04654

Ilan Doron Arad, A. Kulik, H. Shachnai

{"title":"An EPTAS for Budgeted Matroid Independent Set","authors":"Ilan Doron Arad, A. Kulik, H. Shachnai","doi":"10.48550/arXiv.2209.04654","DOIUrl":"https://doi.org/10.48550/arXiv.2209.04654","url":null,"abstract":"We consider the budgeted matroid independent set problem. The input is a ground set, where each element has a cost and a non-negative profit, along with a matroid over the elements and a budget. The goal is to select a subset of elements which maximizes the total profit subject to the matroid and budget constraints. Several well known special cases, where we have, e.g., a uniform matroid and a budget, or no matroid constraint (i.e., the classic knapsack problem), admit a fully polynomial-time approximation scheme (FPTAS). In contrast, already a slight generalization to the multi-budgeted matroid independent set problem has a PTAS but does not admit an efficient polynomial-time approximation scheme (EPTAS). This implies a PTAS for our problem, which is the best known result prior to this work. Our main contribution is an EPTAS for the budgeted matroid independent set problem. A key idea of the scheme is to find a representative set for the instance, whose cardinality depends solely on $1/varepsilon$, where $varepsilon>0$ is the accuracy parameter of the scheme. The representative set is identified via matroid basis minimization, which can be solved by a simple greedy algorithm. Our scheme enumerates over subsets of the representative set and extends each subset using a linear program. The notion of representative sets may be useful in solving other variants of the budgeted matroid independent set problem.","PeriodicalId":93491,"journal":{"name":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","volume":"9 1","pages":"69-83"},"PeriodicalIF":0.0,"publicationDate":"2022-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90048698","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}

引用次数: 5

Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching 稳定匹配的矩阵推广和基数推广的近似算法

Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2022-08-20 DOI: 10.48550/arXiv.2208.09583

Gergely Cs'aji, Tam'as Kir'aly, Yu Yokoi

引用次数: 4

Minimum Cost Adaptive Submodular Cover 最低成本自适应子模块覆盖

Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2022-08-17 DOI: 10.48550/arXiv.2208.08351

Yubing Cui, V. Nagarajan

引用次数: 2

A Tight Analysis of Hutchinson's Diagonal Estimator Hutchinson对角估计量的严密分析

Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2022-08-05 DOI: 10.48550/arXiv.2208.03268

Prathamesh Dharangutte, C. Musco

引用次数: 1

Simpler Adjacency Labeling for Planar Graphs with B-Trees 带b树的平面图邻接标记的简化

Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2022-01-01 DOI: 10.1137/1.9781611977066.3

Paweł Gawrychowski, Wojciech Janczewski

引用次数: 2

Nearly Tight Bounds for Discrete Search under Outlier Noise 离群噪声下离散搜索的近紧界

Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2022-01-01 DOI: 10.1137/1.9781611977066.11

Anindya De, S. Khanna, Huan Li, Hesam Nikpey

{"title":"Nearly Tight Bounds for Discrete Search under Outlier Noise","authors":"Anindya De, S. Khanna, Huan Li, Hesam Nikpey","doi":"10.1137/1.9781611977066.11","DOIUrl":"https://doi.org/10.1137/1.9781611977066.11","url":null,"abstract":"Binary search is one of the most fundamental search routines, exploiting the hidden structure of the search space. In particular, it cuts down exponentially on the complexity of the search assuming that the search space is monotone. This paper is prompted by a basic question – how does the query complexity of the search problem change if the data has corruption? In particular, we study the powerful outlier noise model and assuming a bound on the fraction of such corruptions, establish nearly matching upper and lower bounds for the following problems: (i) binary search on an ordered set of size [ n ] ; (ii) search on the posets { 0 , 1 } d ; and (iii) search on the posets [ n ] d . In all three cases, we use randomization to create robust versions of classical algorithms for these problems that handle corrupted data with relatively small performance penalties, specified as a function of the amount of corruption K . We complement these algorithmic results with almost matching lower bounds that show that no randomized algorithm can solve these problems with a smaller performance hit on the query complexity as a function of K .","PeriodicalId":93491,"journal":{"name":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","volume":"46 1","pages":"161-173"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80779240","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

Parameterizing the Permanent: Hardness for fixed excluded minors 参数化永久硬度:用于固定的不包括小部件的硬度

Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2022-01-01 DOI: 10.1137/1.9781611977066.23

Radu Curticapean, Mingji Xia

引用次数: 3