会议文集


会议名35th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2024)
中译名《第三十五届ACM-SIAM年度离散算法研讨会，卷3》
机构Society for Industrial and Applied Mathematics (SIAM); Association for Computing Machinery (ACM)
会议日期7-10 January 2024
会议地点Alexandria, Virginia, USA
出版年2024
馆藏号351694


题名作者出版年
Beyond the Quadratic Time Barrier for Network UnreliabilityRuoxu Cen; William He; Jason Li; Debmalya Panigrahi2024
On (1 + ε)-Approximate Flow SparsifiersYu Chen; Zihan Tan2024
Max s, t-Flow Oracles and Negative Cycle Detection in Planar DigraphsAdam Karczmarz2024
Breaking the Metric Voting Distortion BarrierMoses Charikar; Kangning Wang; Prasanna Ramakrishnan; Hongxun Wu2024
Composition of nested embeddings with an application to outlier removalShuchi Chawla; Kristin Sheridan2024
On Approximability of Steiner Tree in l_p-metricsHenry Fleischmann; Surya Teja Gavva; Karthik C. S.2024
Improved Approximations for Ultrametric Violation DistanceMoses Charikar; Ruiquan Gao2024
A (3 + ε)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower boundsMoritz Buchem; Katja Ettmayr; Hugo K. K. Rosado; Andreas Wiese2024
On Deterministically Approximating Total Variation DistanceWeiming Feng; Liqiang Liu; Tianren Liu2024
The Sharp Power Law of Local Search on ExpandersSirnina Branzei; Davin Choo; Nicholas Recker2024
Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-RankNathaniel Harms; Viktor Zamaraev2024
Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower boundsTatiana Belova; Alexander S. Kulikov; Ivan Mihajlin; Olga Ratseeva; Grigory Reznikov; Denil Sharipov2024
Count on CFI graphs for #P-hardnessRadu Curticapean2024
On the Hardness of PosSLPPeter Biirgisser; Gorav Jindal2024
Computing the 5-Edge-Connected Components in Linear TimeEvangelos Koainas2024
Edge-Coloring Algorithms for Bounded Degree MultigraphsAbhishek Dhawan2024
Exact Community Recovery in the Geometric SBMJulia Gaudio; Xiaochun Niu; Ermin Wei2024
A Faster Combinatorial Algorithm for Maximum Bipartite MatchingJulia Chuzhoy; Sanjeev Khanna2024
Higher-Order Cheeger Inequality for Partitioning with BuffersKonstantin Makarychev; Yury Makarychev; Liren Shan; Aravindan Vijayaraghavan2024
Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion timeDavid G. Harris2024



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