default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAPPROX/RANDOM 2025: Berkeley, CA, USA
- Alina Ene
, Eshan Chattopadhyay:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2025, Berkeley, CA, USA, August 11-13, 2025. LIPIcs 353, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-397-3 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xxiv
- Kinter Ren, Mohammad R. Salavatipour:
Approximation Schemes for Orienteering and Deadline TSP in Doubling Metrics. 1:1-1:22 - Aniket Basu Roy:
Covering Simple Orthogonal Polygons with Rectangles. 2:1-2:23 - Tamio-Vesa Nakajima, Stanislav Zivný:
Maximum And- vs. Even-SAT. 3:1-3:8 - Chandra Chekuri, Rhea Jain, Sepideh Mahabadi, Ali Vakilian:
Streaming Algorithms for Network Design. 4:1-4:23 - Aditya Anand, Euiwoong Lee, Davide Mazzali, Amatya Sharma:
Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT. 5:1-5:23 - Yanlin Chen, Yilei Chen, Rajendra Kumar, Subhasree Patro, Florian Speelman:
QSETH Strikes Again: Finer Quantum Lower Bounds for Lattice Problem, Strong Simulation, Hitting Set Problem, and More. 6:1-6:24 - Rafail Ostrovsky, Yuval Rabani, Yoav Siman Tov:
Budget and Profit Approximations for Spanning Tree Interdiction. 7:1-7:23 - N. Efe Çekirge, William Gay, David P. Woodruff:
Multipass Linear Sketches for Geometric LP-Type Problems. 8:1-8:25 - Miriam Fischer, Dario Paccagnan, Cosimo Vinci:
Optimal Competitive Ratio for Optimization Problems with Congestion Effects. 9:1-9:24 - Waldo Gálvez, Roberto Oliva, Victor Verdugo:
Improved Approximation Guarantees for Advertisement Placement. 10:1-10:16 - Francesco Agrimonti, Marco Bressan, Tommaso d'Orsi:
On Finding Randomly Planted Cliques in Arbitrary Graphs. 11:1-11:18 - Xiang Liu, Kasturi R. Varadarajan:
Relational Approximations for Subspace Primitives. 12:1-12:16 - Yury Makarychev, Madhusudhan Reddy Pittu, Ali Vakilian:
Max-Cut with Multiple Cardinality Constraints. 13:1-13:21 - Sina Kalantarzadeh, Nikhil Kumar:
Improved Lower Bounds on Multiflow-Multicut Gaps. 14:1-14:18 - Romain Bourneuf, Julien Cocquet, Chaoliang Tang, Stéphan Thomassé:
A Polynomial-Time Approximation Algorithm for Complete Interval Minors. 15:1-15:23 - Tommaso d'Orsi, Chris Jones, Jake Ruotolo, Salil P. Vadhan, Jiyu Zhang:
Sparsest Cut and Eigenvalue Multiplicities on Low Degree Abelian Cayley Graphs. 16:1-16:20 - Nicholas Kocurek, Peter Manohar:
Spectral Refutations of Semirandom k-LIN over Larger Fields. 17:1-17:15 - Sina Kalantarzadeh, Nathan Klein, Victor Reis:
A Randomized Rounding Approach for DAG Edge Deletion. 18:1-18:13 - Ian DeHaan, Neng Huang, Euiwoong Lee:
On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems. 19:1-19:24 - Jungho Ahn, Ian DeHaan, Eun Jung Kim, Euiwoong Lee:
Approximating Maximum Cut on Interval Graphs and Split Graphs Beyond Goemans-Williamson. 20:1-20:22 - Nathan Klein, Mehrshad Taziki:
Dual Charging for Half-Integral TSP. 21:1-21:22 - Elena Grigorescu, Nithish Kumar, Young-San Lin:
Directed Buy-At-Bulk Spanners. 22:1-22:24 - Sayan Bandyapadhyay, Tianzhi Chen:
Improved FPT Approximation for Sum of Radii Clustering with Mergeable Constraints. 23:1-23:17 - Nathan Ju, Ansh Nagda:
Improved Approximation Algorithms for the EPR Hamiltonian. 24:1-24:9 - Tanvi Bajpai, Chandra Chekuri, Pooja Kulkarni:
Covering a Few Submodular Constraints and Applications. 25:1-25:22 - Mads Anker Nielsen, Lars Rohwedder, Kevin Schewior:
Non-Adaptive Evaluation of k-of- n Functions: Tight Gap and a Unit-Cost PTAS. 26:1-26:18 - Fredie George, Anand Louis, Rameesh Paul:
Triangles Improve 0.878 Approximation for Maxcut. 27:1-27:25 - Dean Doron, William M. Hoza:
Implications of Better PRGs for Permutation Branching Programs. 28:1-28:20 - Igor Shinkar, Harsimran Singh:
A Simplified Reduction for Error Correcting Matrix Multiplication Algorithms. 29:1-29:15 - Zhangsong Li:
Algorithmic Contiguity from Low-Degree Conjecture and Applications in Correlated Random Graphs. 30:1-30:18 - Lorenzo Beretta:
New Statistical and Computational Results for Learning Junta Distributions. 31:1-31:23 - Simon Apers, Frédéric Magniez, Sayantan Sen, Dániel Szabó:
Quantum Property Testing in Sparse Directed Graphs. 32:1-32:24 - Dean Doron, Ori Fridman:
Bit-Fixing Extractors for Almost-Logarithmic Entropy. 33:1-33:19 - Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan, Madhu Sudan:
Eigenvalue Bounds for Symmetric Markov Chains on Multislices with Applications. 34:1-34:12 - William M. Hoza, Zelin Lv:
Fooling Near-Maximal Decision Trees. 35:1-35:24 - Ben Chen, Amnon Ta-Shma:
Simplifying Armoni's PRG. 36:1-36:8 - Fatemeh Ghasemi, Gal Gross, Swastik Kopparty:
Permanental Rank vs Determinantal Rank of Random Matrices over Finite Fields. 37:1-37:15 - Omar Alrabiah, Jesse Goodman, Jonathan Mosheiff, João Ribeiro:
Low-Degree Polynomials Are Good Extractors. 38:1-38:25 - Dar Gilboa, Siddhartha Jain, Jarrod R. McClean:
Consumable Data via Quantum Communication. 39:1-39:23 - Alessandro Epasto, Quanquan C. Liu, Tamalika Mukherjee, Felix Zhou:
Sublinear Space Graph Algorithms in the Continual Release Model. 40:1-40:27 - Dariusz R. Kowalski, Piotr Krysta, Shay Kutten:
What Is the Minimum Number of Random Bits Required for Computability and Efficiency in Anonymous Networks? 41:1-41:24 - Yumou Fei, Renato Ferreira Pinto Jr.:
On the Spectral Expansion of Monotone Subsets of the Hypercube. 42:1-42:24 - Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang:
Gabidulin Codes Achieve List Decoding Capacity with an Order-Optimal Column-To-Row Ratio. 43:1-43:20 - Venkatesan Guruswami, Shilun Li:
Density Frankl-Rödl on the Sphere. 44:1-44:18 - Clément L. Canonne, Yun Li, Seeun William Umboh:
Local Computation Algorithms for Knapsack: Impossibility Results, and How to Avoid Them. 45:1-45:21 - Xiaoyu Chen, Hongyang Liu, Yitong Yin, Xinyuan Zhang:
Efficient Parallel Ising Samplers via Localization Schemes. 46:1-46:22 - Zongchen Chen, Dan Mikulincer, Daniel Reichman, Alexander S. Wein:
Time Lower Bounds for the Metropolis Process and Simulated Annealing. 47:1-47:22 - Eren C. Kizildag:
Sharp Thresholds for the Overlap Gap Property: Ising p-Spin Glass and Random k-SAT. 48:1-48:16 - Fernando Granha Jeronimo, Tushant Mittal, Sourya Roy:
Pseudorandomness of Expander Walks via Fourier Analysis on Groups. 49:1-49:22 - Adar Hadad, Moni Naor:
Shared Randomness in Locally Checkable Problems: The Role of Computational Assumptions. 50:1-50:23 - Zongchen Chen, Tianhui Jiang:
Improved Mixing of Critical Hardcore Model. 51:1-51:22 - Simina Brânzei, Reed C. Phillips, Nicholas J. Recker:
Tarski Lower Bounds from Multi-Dimensional Herringbones. 52:1-52:12 - Ray Li, Nikhil Shagrithaya:
Near-Optimal List-Recovery of Linear Code Families. 53:1-53:14 - Surendra Ghentiyala, Venkatesan Guruswami:
New Constructions of Pseudorandom Codes. 54:1-54:22 - Farzan Byramji, Russell Impagliazzo:
Lifting to Randomized Parity Decision Trees. 55:1-55:22 - Partha Mukhopadhyay, C. Ramya, Pratik Shastri:
Efficient Polynomial Identity Testing over Nonassociative Algebras. 56:1-56:22 - Dean Doron, Jonathan Mosheiff, Nicolas Resch, João Ribeiro:
List-Recovery of Random Linear Codes over Small Fields. 57:1-57:18 - Mika Göös, Nathaniel Harms, Artur Riazanov:
Equality Is Far Weaker Than Constant-Cost Communication. 58:1-58:14 - Sumegha Garg, Madhu Sudan, Gabriel Wu:
Testing Tensor Products of Algebraic Codes. 59:1-59:12 - Konrad Anand, Graham Freifeld, Heng Guo, Chunyang Wang, Jiaheng Wang:
Sink-Free Orientations: A Local Sampler with Applications. 60:1-60:19 - Cassandra Marcussen, Edward Pyne, Ronitt Rubinfeld, Asaf Shapira, Shlomo Tauber:
A Fast Coloring Oracle for Average Case Hypergraphs. 61:1-61:13 - Neha Kuntewar, Jayalal Sarma:
Avoiding Range via Turan-Type Bounds. 62:1-62:21 - Benny Applebaum, Dung Bui, Geoffroy Couteau, Nikolas Melissaris:
Structured-Seed Local Pseudorandom Generators and Their Applications. 63:1-63:26 - Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan:
Searching for Falsified Clause in Random (log{n})-CNFs Is Hard for Randomized Communication. 64:1-64:17 - Alina Ene, Huy Le Nguyen, Ta Duy Nguyen, Adrian Vladu:
Solving Linear Programs with Differential Privacy. 65:1-65:17 - Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy:
Testing Isomorphism of Boolean Functions over Finite Abelian Groups. 66:1-66:22 - William M. Hoza, Zelin Lv:
On Sums of INW Pseudorandom Generators. 67:1-67:24 - Xiaoyu Chen, Weiming Feng:
Rapid Mixing via Coupling Independence for Spin Systems with Unbounded Degree. 68:1-68:17
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 2026-04-03 00:22 CEST 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:
