会议文集


会议名36th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2025)
中译名《第三十六届ACM-SIAM年度离散算法研讨会，卷1》
机构Society for Industrial and Applied Mathematics (SIAM); Association for Computing Machinery (ACM)
会议日期12-15 January 2025
会议地点New Orleans, Louisiana, USA
出版年2025
馆藏号355115


题名作者出版年
Connectivity Labeling Schemes for Edge and Vertex Faults via Expander HierarchiesYaowei Long; Seth Pettie; Thatchaphol Saranurak2025
A Dichotomy Hierarchy for Linear Time Subgraph Counting in Bounded Degeneracy GraphsDaniel Paul-Pena; C. Seshadhri2025
Embedding Planar Graphs into Graphs of Treewidth O(log~3 n)Hsien-Chih Chang; Vincent Cohen-Addad; Jonathan Conroy; Hung Le; Marcin Pilipczuk; Michal Pilipczuk2025
Deterministic Edge Connectivity and Max Flow using Subquadratic Cut QueriesAditya Anand; Thatchaphol Saranurak; Yunfan Wang2025
Massively Parallel Minimum Spanning Tree in General Metric SpacesAmir Azarmehr; Soheil Behnezhad; Rajesh Jayaram; Jakub Lacki; Vahab Mirrokni; Peilin Zhong2025
Beyond 2-Approximation for k-Center in GraphsCe Jin; Yael Kirkpatrick; Virginia Vassilevska Williams; Nicole Wein2025
Dynamic Consistent k-Center Clustering with Optimal RecourseSebastian Forster; Antonis Skarlatos2025
Clustering to Minimize Cluster-Aware Norm ObjectivesMartin G. Herold; Evangelos Kipouridis; Joachim Spoerhase2025
Clustering Mixtures of Bounded Covariance Distributions Under Optimal SeparationIlias Diakonikolas; Daniel M. Kane; Jasper C. H. Lee; Thanasis Pittas2025
Breaking the Two Approximation Barrier for Various Consensus Clustering ProblemsDebarati Das; Amit Kumar2025
Relative-error monotonicity testingXi Chen; Anindya De; Yizhi Huang; Yuhao Li; Shivam Nadimpalli; Rocco A. Servedio; Tianqi Yang2025
Nearly Tight Bounds on Testing of Metric PropertiesYiqiao Bao; Sampath Kannan; Erik Waingarten2025
Lower Bounds for Convexity TestingXi Chen; Anindya De; Shivam Nadimpalli; Rocco A. Servedio; Erik Waingarten2025
Tight Sampling Bounds for Eigenvalue ApproximationWilliam Swartworth; David P. Woodruff2025
Near-Optimal-Time Quantum Algorithms for Approximate Pattern MatchingTomasz Kociumaka; Jakob Nogler; Philip Wellnitz2025
A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence ConstraintsJesper Nederlof; Celine M. F. Swennenhuis; Karol Wegrzycki2025
Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted ProofsShi Li2025
Lift-and-Project Integrality Gaps for Santa ClausEtienne Bamas2025
The Submodular Santa Claus ProblemEtienne Bamas; Sarah Morell; Lars Rohwedder2025
A Tight (3/2 + ε)-Approximation Algorithm for Demand Strip PackingFranziska Eberle; Felix Hommelsheim; Malin Rau; Stefan Walzer2025



国家科技图书文献中心  全球文献资源网  京ICP备05055788号-26  京公网安备11010202008970号  机械工业信息研究院 2018-2024