default search action
6th SOSA 2023: Florence, Italy
- Telikepalli Kavitha, Kurt Mehlhorn:
2023 Symposium on Simplicity in Algorithms, SOSA 2023, Florence, Italy, January 23-25, 2023. SIAM 2023, ISBN 978-1-61197-758-5 - Anupam Gupta, Euiwoong Lee, Jason Li:
A Local Search-Based Approach for Set Covering. 1-11 - Yubing Cui, Viswanath Nagarajan:
Minimum Cost Adaptive Submodular Cover. 12-27 - Dor Katzelnick, Roy Schwartz:
A Simple Algorithm for Submodular Minimum Linear Ordering. 28-35 - Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Approximate minimum cuts and their enumeration. 36-41 - Li Chen, Rasmus Kyng, Maximilian Probst Gutenberg
, Sushant Sachdeva:
A Simple Framework for Finding Balanced Sparse Cuts via APSP. 42-55 - Emmett Breen, Renee Mirka, Zichen Wang
Revisiting Garg's 2-Approximation Algorithm for the k-MST Problem in Graphs. 56-68 - Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Budgeted Matroid Independent Set. 69-83 - Richard Santiago, Ivan Sergeev
Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information. 84-95 - Georg Anegg, Laura Vargas Koch, Rico Zenklusen:
A Simple Combinatorial Algorithm for Robust Matroid Center. 96-102 - Gergely Kál Csáji, Tamás Király, Yu Yokoi:
Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching. 103-113 - Tobias Mömke, Hang Zhou:
Capacitated Vehicle Routing in Graphic Metrics. 114-123 - Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler, Alantha Newman:
Voting algorithms for unique games on complete graphs. 124-136 - Josh Alman:
Faster Walsh-Hadamard Transform and Matrix Multiplication over Finite Fields using Lookup Tables. 137-144 - Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi:
On the Fine-Grained Complexity of Approximating k-Center in Sparse Graphs. 145-155 - Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Simpler and faster algorithms for detours in planar digraphs. 156-165 - Václav Rozhon, Bernhard Haeupler, Christoph Grunau
A Simple Deterministic Distributed Low-Diameter Clustering. 166-174 - Alkida Balliu
Sinkless Orientation Made Simple. 175-191 - Volkan Cevher
Min-Max Optimization Made Simple: Approximating the Proximal Point Method via Contraction Maps. 192-206 - Meghal Gupta, Naren Sarayu Manoj:
An Optimal Algorithm for Certifying Monotone Functions. 207-212 - Sepehr Assadi, Vihan Shah
Tight Bounds for Vertex Connectivity in Dynamic Streams. 213-227 - Jakob Bæk Tejs Houen, Rasmus Pagh
Simple Set Sketching. 228-241 - Shyam Narayanan, Jakub Tetek:
Estimating the Effective Support Size in Constant Query Complexity. 242-252 - Talya Eden, Shyam Narayanan, Jakub Tetek:
Sampling an Edge in Sublinear Time Exactly and Optimally. 253-260 - Binghui Peng, Aviad Rubinstein:
Fully-dynamic-to-incremental reductions with known deletion order (e.g. sliding window). 261-271 - Peyman Afshani, Pingan Cheng:
An Optimal Lower Bound for Simplex Range Reporting. 272-277 - Alexander Golovnev, Tom Gur
Derandomization of Cell Sampling. 278-284 - Robert E. Tarjan, Uri Zwick:
Optimal resizable arrays. 285-304 - Jacob Holm, Eva Rotenberg
Splay Top Trees. 305-331 - Oliver A. Chubet, Parth Parikh, Donald R. Sheehy, Siddharth S. Sheth:
Proximity Search in the Greedy Tree. 332-342 - Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. 343-347 - Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia:
Gaussian Mean Testing Made Simple. 348-352 - Prathamesh Dharangutte, Christopher Musco:
A Tight Analysis of Hutchinson's Diagonal Estimator. 353-364 - Maxime Larcher
A Simple Optimal Algorithm for the 2-Arm Bandit Problem. 365-372 - Lucas Gretta, Eric Price:
An Improved Online Reduction from PAC Learning to Mistake-Bounded Learning. 373-380 - Alexander Braun, Thomas Kesselheim:
Simplified Prophet Inequalities for Combinatorial Auctions. 381-389
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-23 19:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: