| 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.  |
APPROX-RANDOM  |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Susanne Albers, Sebastian Schubert |
Optimal Algorithms for Online b-Matching with Variable Vertex Capacities. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sankeerth Rao Karingula, Shachar Lovett |
Singularity of Random Integer Matrices with Large Entries. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta 0001, Amit Kumar 0001, Sahil Singla 0001 |
Bag-Of-Tasks Scheduling on Related Machines. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Rocco A. Servedio, Li-Yang Tan |
Deterministic Approximate Counting of Polynomial Threshold Functions via a Derandomized Regularity Lemma. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Calum MacRury, Akash Rakheja |
Secretary Matching Meets Probing with Commitment. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandan Saha 0001, Bhargav Thankey |
Hitting Sets for Orbits of Circuit Classes and Polynomial Families. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Inbar Ben Yaacov, Gil Cohen, Anand Kumar Narayanan |
Candidate Tree Codes via Pascal Determinant Cubes. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Omar Alrabiah, Venkatesan Guruswami |
Visible Rank and Codes with Locality. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal |
Hardness of Approximation for Euclidean k-Median. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Rikhav Shah, Sandeep Silwal |
Smoothed Analysis of the Condition Number Under Low-Rank Perturbations. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Umang Bhaskar, A. R. Sricharan, Rohit Vaish |
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda |
The Swendsen-Wang Dynamics on Trees. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Kuikui Liu |
From Coupling to Spectral Independence and Blackbox Comparison with the Down-Up Walk. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Arijit Bishnu, Arijit Ghosh, Gopinath Mishra |
Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Varsha Dani, Diksha Gupta, Thomas P. Hayes |
On the Power of Choice for k-Colorability of Random Graphs. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Reut Levi, Nadav Shoshan |
Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Kent Quanrud, Manuel R. Torres |
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Hossein Jowhari |
An Estimator for Matching Size in Low Arboricity Graphs with Two Applications. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Talya Eden, Saleet Mossel, Ronitt Rubinfeld |
Sampling Multiple Edges Efficiently. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sepehr Assadi, Soheil Behnezhad |
On the Robust Communication Complexity of Bipartite Matching. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandip Banerjee, Rafail Ostrovsky, Yuval Rabani |
Min-Sum Clustering (With Outliers). |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Grigorescu, Young-San Lin, Kent Quanrud |
Online Directed Spanners and Steiner Forests. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar |
Query Complexity of Global Minimum Cut. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sumegha Garg, Pravesh K. Kothari, Pengda Liu, Ran Raz |
Memory-Sample Lower Bounds for Learning Parity with Noise. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
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). |
APPROX-RANDOM |
2021 |
DBLP BibTeX RDF |
|
| 1 | Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann |
Fine-Grained Completeness for Optimization in P. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Yi Li 0002, David P. Woodruff |
The Product of Gaussian Matrices Is Close to Gaussian. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Louis Golowich |
Improved Product-Based High-Dimensional Expanders. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Srikanth Srinivasan 0001, S. Venkitesh |
On the Probabilistic Degree of an n-Variate Boolean Function. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Eun Jung Kim 0002, Euiwoong Lee, Dimitrios M. Thilikos |
A Constant-Factor Approximation for Weighted Bond Cover. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Uma Girish, Ran Raz, Wei Zhan |
Lower Bounds for XOR of Forrelations. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Waldo Gálvez, Fabrizio Grandoni 0001, Afrouz Jabal Ameli, Kamyar Khodamoradi |
Approximation Algorithms for Demand Strip Packing. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz |
General Knapsack Problems in a Dynamic Setting. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Ninad Rajgopal, Rahul Santhanam |
On the Structure of Learnability Beyond P/Poly. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | William M. Hoza |
Better Pseudodistributions and Derandomization for Space-Bounded Computation. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajesh Jayaram, John Kallaugher |
An Optimal Algorithm for Triangle Counting in the Stream. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Aditya Parulekar, Advait Parulekar, Eric Price 0001 |
L1 Regression with Lewis Weights Subsampling. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar 0001, Madhu Sudan 0001 |
Ideal-Theoretic Explanation of Capacity-Achieving Decoding. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Kshipra Bhawalkar, Kostas Kollias, Manish Purohit |
Revenue Maximization in Transportation Networks. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Noah Singer, Madhu Sudan 0001, Santhoshini Velusamy |
Streaming Approximation Resistance of Every Ordering CSP. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Arindam Khan 0001, Eklavya Sharma |
Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonio Blanca, Alistair Sinclair, Xusheng Zhang |
The Critical Mean-Field Chayes-Machta Dynamics. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Galanis, Leslie Ann Goldberg, James Stewart 0001 |
Fast Mixing via Polymers for Random Graphs with Unbounded Degree. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sumanta Ghosh, Rohit Gurjar |
Matroid Intersection: A Pseudo-Deterministic Parallel Reduction from Search to Weighted-Decision. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Fotis Iliopoulos |
Improved Bounds for Coloring Locally Sparse Hypergraphs. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Vishwas Bhargava, Sumanta Ghosh |
Improved Hitting Set for Orbit of ROABPs. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Konrad 0001, Kheeran K. Naidu |
On Two-Pass Streaming Algorithms for Maximum Bipartite Matching. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun |
Hitting Weighted Even Cycles in Planar Graphs. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvika Brakerski, Noah Stephens-Davidowitz, Vinod Vaikuntanathan |
On the Hardness of Average-Case k-SUM. |
APPROX-RANDOM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Ainesh Bakshi, Nadiia Chepurko, David P. Woodruff |
Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Wei 0001 |
Better and Simpler Learning-Augmented Online Caching. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Dreier, Philipp Kuinke, Peter Rossmanith |
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Arindam Khan 0001, Madhusudhan Reddy Pittu |
On Guillotine Separability of Squares and Rectangles. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sayan Bandyapadhyay |
On Perturbation Resilience of Non-Uniform k-Center. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Karine Chubarian, Anastasios Sidiropoulos |
Computing Bi-Lipschitz Outlier Embeddings into the Line. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ishan Agarwal, Oded Regev 0001, Yi Tang |
Nearly Optimal Embeddings of Flat Tori. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Tatiana Starikovskaya, Michal Svagerka, Przemyslaw Uznanski |
Lp Pattern Matching in a Stream. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu 0002 |
Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Neng Huang, Aaron Potechin |
On the Approximability of Presidential Type Predicates. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Syamantak Das, Lavina Jain, Nikhil Kumar 0001 |
A Constant Factor Approximation for Capacitated Min-Max Tree Cover. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Divesh Aggarwal, Siyao Guo, Maciej Obremski, João Ribeiro 0002, Noah Stephens-Davidowitz |
Extractor Lower Bounds, Revisited. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak |
Pinning down the Strong Wilber 1 Bound for Binary Search Trees. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nima Anari, Thuy-Duong Vuong |
An Extension of Plücker Relations with Applications to Subdeterminant Maximization. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Jakub Oprsal, Sai Sandeep |
Revisiting Alphabet Reduction in Dinur's PCP. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Ella Sharakanski |
Chernoff Bound for High-Dimensional Expanders. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Chien-Chung Huang, Theophile Thiery, Justin Ward |
Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Blais, Abhinav Bommireddi |
On Testing and Robust Characterizations of Convexity. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ben Lund 0002, Aditya Potukuchi |
On the List Recoverability of Randomly Punctured Codes. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sean Hallgren, Eunou Lee, Ojas Parekh |
An Approximation Algorithm for the MAX-2-Local Hamiltonian Problem. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicole Megow, Lukas Nölke |
Online Minimum Cost Matching with Recourse on the Line. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuichi Hirahara, Osamu Watanabe 0001 |
On Nonadaptive Security Reductions of Hitting Set Generators. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Price 0001, Jonathan Scarlett |
A Fast Binary Splitting Approach to Non-Adaptive Group Testing. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Bohan Fan, Diego Ihara, Neshat Mohammadi, Francesco Sgherzi, Anastasios Sidiropoulos, Mina Valizadeh |
Learning Lines with Ordinal Constraints. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Sepehr Assadi |
Palette Sparsification Beyond (Δ+1) Vertex Coloring. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff M. Phillips, Wai Ming Tai |
The GaussianSketch for Almost Relative Error Kernel Distance. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Amey Bhangale, Diptarka Chakraborty, Rajendra Kumar 0002 |
Hardness of Approximation of (Multi-)LCS over Small Alphabet. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license