Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Chien-Chung Huang, François Sellier |
Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 14:1-14:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Susanne Albers, Sebastian Schubert |
Optimal Algorithms for Online b-Matching with Variable Vertex Capacities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 2:1-2:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sankeerth Rao Karingula, Shachar Lovett |
Singularity of Random Integer Matrices with Large Entries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 33:1-33:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Anupam Gupta 0001, Amit Kumar 0001, Sahil Singla 0001 |
Bag-Of-Tasks Scheduling on Related Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 3:1-3:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Rocco A. Servedio, Li-Yang Tan |
Deterministic Approximate Counting of Polynomial Threshold Functions via a Derandomized Regularity Lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 37:1-37:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Allan Borodin, Calum MacRury, Akash Rakheja |
Secretary Matching Meets Probing with Commitment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 13:1-13:23, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Chandan Saha 0001, Bhargav Thankey |
Hitting Sets for Orbits of Circuit Classes and Polynomial Families. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 50:1-50:26, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Inbar Ben Yaacov, Gil Cohen, Anand Kumar Narayanan |
Candidate Tree Codes via Pascal Determinant Cubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 54:1-54:22, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Omar Alrabiah, Venkatesan Guruswami |
Visible Rank and Codes with Locality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 57:1-57:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal |
Hardness of Approximation for Euclidean k-Median. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 4:1-4:23, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Rikhav Shah, Sandeep Silwal |
Smoothed Analysis of the Condition Number Under Low-Rank Perturbations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 40:1-40:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 0:1-0:10, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | David G. Harris 0001, Fotis Iliopoulos, Vladimir Kolmogorov |
A New Notion of Commutativity for the Algorithmic Lovász Local Lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 31:1-31:25, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Umang Bhaskar, A. R. Sricharan, Rohit Vaish |
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 1:1-1:23, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda |
The Swendsen-Wang Dynamics on Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 43:1-43:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Kuikui Liu |
From Coupling to Spectral Independence and Blackbox Comparison with the Down-Up Walk. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 32:1-32:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Brian Brubach, Nathaniel Grammel, David G. Harris 0001, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti |
Approximating Two-Stage Stochastic Supplier Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 23:1-23:22, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Arijit Bishnu, Arijit Ghosh, Gopinath Mishra |
Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 44:1-44:22, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Ralf Borndörfer, Katrin Casel, Davis Issac, Aikaterini Niklanovits, Stephan Schwartz, Ziena Zeif |
Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 27:1-27:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Varsha Dani, Diksha Gupta, Thomas P. Hayes |
On the Power of Choice for k-Colorability of Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 59:1-59:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Reut Levi, Nadav Shoshan |
Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 61:1-61:23, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Chandra Chekuri, Kent Quanrud, Manuel R. Torres |
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 24:1-24:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan |
Parallel Repetition for the GHZ Game: A Simpler Proof. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 62:1-62:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Hossein Jowhari |
An Estimator for Matching Size in Low Arboricity Graphs with Two Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 10:1-10:13, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt 0001, Julian Wargalla |
Upper and Lower Bounds for Complete Linkage in General Metric Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 18:1-18:22, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Talya Eden, Saleet Mossel, Ronitt Rubinfeld |
Sampling Multiple Edges Efficiently. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 51:1-51:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Jaroslaw Blasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, Emanuele Viola |
Fourier Growth of Structured 2-Polynomials and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 53:1-53:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sepehr Assadi, Soheil Behnezhad |
On the Robust Communication Complexity of Bipartite Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 48:1-48:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sandip Banerjee, Rafail Ostrovsky, Yuval Rabani |
Min-Sum Clustering (With Outliers). ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 16:1-16:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Elena Grigorescu, Young-San Lin, Kent Quanrud |
Online Directed Spanners and Steiner Forests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 5:1-5:25, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar |
Query Complexity of Global Minimum Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 6:1-6:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan |
Pseudorandom Generators for Read-Once Monotone Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 58:1-58:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sumegha Garg, Pravesh K. Kothari, Pengda Liu, Ran Raz |
Memory-Sample Lower Bounds for Learning Parity with Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 60:1-60:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sourav Chakraborty 0001, Arijit Ghosh, Gopinath Mishra, Sayantan Sen |
Interplay Between Graph Isomorphism and Earth Mover's Distance in the Query and Communication Worlds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 34:1-34:23, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan |
Decision Tree Heuristics Can Fail, Even in the Smoothed Setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 45:1-45:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Mary Wootters, Laura Sanità (eds.) |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference). ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5 The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
1 | Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann |
Fine-Grained Completeness for Optimization in P. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 9:1-9:22, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Yi Li 0002, David P. Woodruff |
The Product of Gaussian Matrices Is Close to Gaussian. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 35:1-35:22, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Louis Golowich |
Improved Product-Based High-Dimensional Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 38:1-38:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Srikanth Srinivasan 0001, S. Venkitesh |
On the Probabilistic Degree of an n-Variate Boolean Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 42:1-42:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Eun Jung Kim 0002, Euiwoong Lee, Dimitrios M. Thilikos |
A Constant-Factor Approximation for Weighted Bond Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 7:1-7:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Uma Girish, Ran Raz, Wei Zhan |
Lower Bounds for XOR of Forrelations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 52:1-52:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Waldo Gálvez, Fabrizio Grandoni 0001, Afrouz Jabal Ameli, Kamyar Khodamoradi |
Approximation Algorithms for Demand Strip Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 20:1-20:24, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz |
General Knapsack Problems in a Dynamic Setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 15:1-15:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Ninad Rajgopal, Rahul Santhanam |
On the Structure of Learnability Beyond P/Poly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 46:1-46:23, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | William M. Hoza |
Better Pseudodistributions and Derandomization for Space-Bounded Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 28:1-28:23, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Rajesh Jayaram, John Kallaugher |
An Optimal Algorithm for Triangle Counting in the Stream. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 11:1-11:11, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Aditya Parulekar, Advait Parulekar, Eric Price 0001 |
L1 Regression with Lewis Weights Subsampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 49:1-49:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar 0001, Madhu Sudan 0001 |
Ideal-Theoretic Explanation of Capacity-Achieving Decoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 56:1-56:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Kshipra Bhawalkar, Kostas Kollias, Manish Purohit |
Revenue Maximization in Transportation Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 26:1-26:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Max A. Deppert, Klaus Jansen, Arindam Khan 0001, Malin Rau, Malte Tutas |
Peak Demand Minimization via Sliced Strip Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 21:1-21:24, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | János Balogh, Ilan Reuven Cohen, Leah Epstein, Asaf Levin |
Truly Asymptotic Lower Bounds for Online Vector Bin Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 8:1-8:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Noah Singer, Madhu Sudan 0001, Santhoshini Velusamy |
Streaming Approximation Resistance of Every Ordering CSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 17:1-17:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Arindam Khan 0001, Eklavya Sharma |
Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 22:1-22:23, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Antonio Blanca, Alistair Sinclair, Xusheng Zhang |
The Critical Mean-Field Chayes-Machta Dynamics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 47:1-47:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Omar El Housni, Vineet Goyal, Oussama Hanguir, Clifford Stein 0001 |
Matching Drivers to Riders: A Two-Stage Robust Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 12:1-12:22, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Galanis, Leslie Ann Goldberg, James Stewart 0001 |
Fast Mixing via Polymers for Random Graphs with Unbounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 36:1-36:13, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sumanta Ghosh, Rohit Gurjar |
Matroid Intersection: A Pseudo-Deterministic Parallel Reduction from Search to Weighted-Decision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 41:1-41:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Fotis Iliopoulos |
Improved Bounds for Coloring Locally Sparse Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 39:1-39:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Vishwas Bhargava, Sumanta Ghosh |
Improved Hitting Set for Orbit of ROABPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 30:1-30:23, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Christian Konrad 0001, Kheeran K. Naidu |
On Two-Pass Streaming Algorithms for Maximum Bipartite Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 19:1-19:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Amartya Shankha Biswas, Talya Eden, Ronitt Rubinfeld |
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 55:1-55:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun |
Hitting Weighted Even Cycles in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 25:1-25:23, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Zvika Brakerski, Noah Stephens-Davidowitz, Vinod Vaikuntanathan |
On the Hardness of Average-Case k-SUM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 29:1-29:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Ainesh Bakshi, Nadiia Chepurko, David P. Woodruff |
Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 64:1-64:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Sarah Miracle, Amanda Pascoe Streib, Noah Streib |
Iterated Decomposition of Biased Permutations via New Bounds on the Spectral Gap of Markov Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 3:1-3:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Wei 0001 |
Better and Simpler Learning-Augmented Online Caching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 60:1-60:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar 0001 |
On Multilinear Forms: Bias, Correlation, and Tensor Rank. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 29:1-29:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jan Dreier, Philipp Kuinke, Peter Rossmanith |
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 14:1-14:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Arindam Khan 0001, Madhusudhan Reddy Pittu |
On Guillotine Separability of Squares and Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 47:1-47:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Sayan Bandyapadhyay |
On Perturbation Resilience of Non-Uniform k-Center. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 31:1-31:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang |
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 61:1-61:12, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Karine Chubarian, Anastasios Sidiropoulos |
Computing Bi-Lipschitz Outlier Embeddings into the Line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 36:1-36:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Ishan Agarwal, Oded Regev 0001, Yi Tang |
Nearly Optimal Embeddings of Flat Tori. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 43:1-43:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Tatiana Starikovskaya, Michal Svagerka, Przemyslaw Uznanski |
Lp Pattern Matching in a Stream. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 35:1-35:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu 0002 |
Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 17:1-17:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 0:1-0:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Neng Huang, Aaron Potechin |
On the Approximability of Presidential Type Predicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 58:1-58:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Syamantak Das, Lavina Jain, Nikhil Kumar 0001 |
A Constant Factor Approximation for Capacitated Min-Max Tree Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 55:1-55:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Divesh Aggarwal, Siyao Guo, Maciej Obremski, João Ribeiro 0002, Noah Stephens-Davidowitz |
Extractor Lower Bounds, Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 1:1-1:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak |
Pinning down the Strong Wilber 1 Bound for Binary Search Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 33:1-33:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Nima Anari, Thuy-Duong Vuong |
An Extension of Plücker Relations with Applications to Subdeterminant Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 56:1-56:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan Guruswami, Jakub Oprsal, Sai Sandeep |
Revisiting Alphabet Reduction in Dinur's PCP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 34:1-34:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Tali Kaufman, Ella Sharakanski |
Chernoff Bound for High-Dimensional Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 25:1-25:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Chien-Chung Huang, Theophile Thiery, Justin Ward |
Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 62:1-62:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Eric Blais, Abhinav Bommireddi |
On Testing and Robust Characterizations of Convexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 18:1-18:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Ben Lund 0002, Aditya Potukuchi |
On the List Recoverability of Randomly Punctured Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 30:1-30:11, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Xiangyu Guo, Janardhan Kulkarni, Shi Li 0001, Jiayi Xian |
On the Facility Location Problem in Online and Dynamic Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 42:1-42:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Cyrus Rashtchian, David P. Woodruff, Hanlin Zhu |
Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 26:1-26:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Sean Hallgren, Eunou Lee, Ojas Parekh |
An Approximation Algorithm for the MAX-2-Local Hamiltonian Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 59:1-59:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Sumegha Garg, Pravesh K. Kothari, Ran Raz |
Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 21:1-21:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Chun-Hsiang Chan, Bundit Laekhanukit, Hao-Ting Wei, Yuhao Zhang 0001 |
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 63:1-63:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Nicole Megow, Lukas Nölke |
Online Minimum Cost Matching with Recourse on the Line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 37:1-37:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Lior Ben Yamin, Jing Li 0025, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai |
Maximizing Throughput in Flow Shop Real-Time Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 48:1-48:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Shuichi Hirahara, Osamu Watanabe 0001 |
On Nonadaptive Security Reductions of Hitting Set Generators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 15:1-15:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Eric Price 0001, Jonathan Scarlett |
A Fast Binary Splitting Approach to Non-Adaptive Group Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 13:1-13:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Bohan Fan, Diego Ihara, Neshat Mohammadi, Francesco Sgherzi, Anastasios Sidiropoulos, Mina Valizadeh |
Learning Lines with Ordinal Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 45:1-45:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Noga Alon, Sepehr Assadi |
Palette Sparsification Beyond (Δ+1) Vertex Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 6:1-6:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jeff M. Phillips, Wai Ming Tai |
The GaussianSketch for Almost Relative Error Kernel Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 12:1-12:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Amey Bhangale, Diptarka Chakraborty, Rajendra Kumar 0002 |
Hardness of Approximation of (Multi-)LCS over Small Alphabet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 38:1-38:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|