| 451 |
Set Cover in Sub-linear Time
Piotr Indyk, Sepideh Mahabadi, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
13 |
7 years ago |
| 452 |
Flow-Cut Gaps and Face Covers in Planar Graphs
Robert Krauthgamer, James R. Lee, Havana Rika
|
👻
Ghosted
|
cs.DS
|
13 |
7 years ago |
| 453 |
A PTAS for Euclidean TSP with Hyperplane Neighborhoods
Antonios Antoniadis, Krzysztof Fleszar, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
13 |
8 years ago |
| 454 |
The $(h,k)$-Server Problem on Bounded Depth Trees
Nikhil Bansal, Marek Eliáš, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
13 |
9 years ago |
| 455 |
Playing Anonymous Games using Simple Strategies
Yu Cheng, Ilias Diakonikolas, Alistair Stewart
|
👻
Ghosted
|
cs.GT
|
13 |
9 years ago |
| 456 |
Distance Sensitive Bloom Filters Without False Negatives
Mayank Goswami, Rasmus Pagh, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
13 |
10 years ago |
| 457 |
Tight Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
Sam Chiu-wai Wong
|
👻
Ghosted
|
cs.DS
|
13 |
10 years ago |
| 458 |
Curve Simplification and Clustering under Fréchet Distance
Siu-Wing Cheng, Haoqiang Huang
|
👻
Ghosted
|
cs.CG
|
13 |
4 years ago |
| 459 |
Fixed-Parameter Tractability of Maximum Colored Path and Beyond
Fedor V. Fomin, Petr A. Golovach, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
13 |
4 years ago |
| 460 |
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time
Sally Dong, Yu Gao, ... (+5 more)
|
👻
Ghosted
|
cs.DS
|
13 |
4 years ago |
| 461 |
Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds
Yair Bartal, Ora N. Fandina, Seeun William Umboh
|
👻
Ghosted
|
cs.DS
|
12 |
1 year ago |
| 462 |
The Time Complexity of Fully Sparse Matrix Multiplication
Amir Abboud, Karl Bringmann, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
2 years ago |
| 463 |
Fair Price Discrimination
Siddhartha Banerjee, Kamesh Munagala, ... (+2 more)
|
👻
Ghosted
|
cs.GT
|
12 |
3 years ago |
| 464 |
On the Unreasonable Effectiveness of Single Vector Krylov Methods for Low-Rank Approximation
Raphael A. Meyer, Cameron Musco, Christopher Musco
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 465 |
Fully Dynamic Exact Edge Connectivity in Sublinear Time
Gramoz Goranci, Monika Henzinger, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 466 |
New Data Structures for Orthogonal Range Reporting and Range Minima Queries
Yakov Nekrich
|
👻
Ghosted
|
cs.DS
|
12 |
6 years ago |
| 467 |
All-Pairs LCA in DAGs: Breaking through the $O(n^{2.5})$ barrier
Fabrizio Grandoni, Giuseppe F. Italiano, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
12 |
6 years ago |
| 468 |
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics
Jesper Nederlof, Jakub Pawlewicz, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
6 years ago |
| 469 |
Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution
Sungjin Im, Maryam Shadloo
|
👻
Ghosted
|
cs.DS
|
12 |
6 years ago |
| 470 |
The Power of the Combined Basic LP and Affine Relaxation for Promise CSPs
Joshua Brakensiek, Venkatesan Guruswami, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
7 years ago |
| 471 |
Linear Size Sparsifier and the Geometry of the Operator Norm Ball
Victor Reis, Thomas Rothvoss
|
👻
Ghosted
|
cs.DS
|
12 |
7 years ago |
| 472 |
Efficiently Approximating Edit Distance Between Pseudorandom Strings
William Kuszmaul
|
👻
Ghosted
|
cs.DS
|
12 |
7 years ago |
| 473 |
Optimal Las Vegas Approximate Near Neighbors in $\ell_p$
Alexander Wei
|
👻
Ghosted
|
cs.DS
|
12 |
8 years ago |
| 474 |
A Faster External Memory Priority Queue with DecreaseKeys
Shunhua Jiang, Kasper Green Larsen
|
👻
Ghosted
|
cs.DS
|
12 |
8 years ago |
| 475 |
Finding a Bounded-Degree Expander Inside a Dense One
Luca Becchetti, Andrea Clementi, ... (+3 more)
|
👻
Ghosted
|
cs.DC
|
12 |
7 years ago |
| 476 |
Algorithms to Approximate Column-Sparse Packing Problems
Brian Brubach, Karthik Abinav Sankararaman, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
8 years ago |
| 477 |
Improved Bounds for Testing Forbidden Order Patterns
Omri Ben-Eliezer, Clément L. Canonne
|
👻
Ghosted
|
cs.DS
|
12 |
8 years ago |
| 478 |
Incremental DFS algorithms: a theoretical and experimental study
Surender Baswana, Ayush Goel, Shahbaz Khan
|
👻
Ghosted
|
cs.DS
|
12 |
9 years ago |
| 479 |
Approximating the Largest Root and Applications to Interlacing Families
Nima Anari, Shayan Oveis Gharan, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
9 years ago |
| 480 |
Oblivious resampling oracles and parallel algorithms for the Lopsided Lovasz Local Lemma
David G. Harris
|
👻
Ghosted
|
cs.DS
|
12 |
9 years ago |
| 481 |
LAST but not Least: Online Spanners for Buy-at-Bulk
Anupam Gupta, R. Ravi, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
9 years ago |
| 482 |
LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs
Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
|
👻
Ghosted
|
cs.CG
|
12 |
9 years ago |
| 483 |
Maximum Scatter TSP in Doubling Metrics
László Kozma, Tobias Mömke
|
👻
Ghosted
|
cs.DS
|
12 |
10 years ago |
| 484 |
Quartic quantum speedups for planted inference
Alexander Schmidhuber, Ryan O'Donnell, ... (+2 more)
|
👻
Ghosted
|
quant-ph
|
12 |
2 years ago |
| 485 |
Discrepancy Minimization via Regularization
Lucas Pesenti, Adrian Vladu
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 486 |
On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs
Kim-Manuel Klein, Adam Polak, Lars Rohwedder
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 487 |
Improved Bounds for Sampling Solutions of Random CNF Formulas
Kun He, Kewen Wu, Kuan Yang
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 488 |
A tight quasi-polynomial bound for Global Label Min-Cut
Lars Jaffke, Paloma T. Lima, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
12 |
4 years ago |
| 489 |
Near-Linear Time Approximations for Cut Problems via Fair Cuts
Jason Li, Danupon Nanongkai, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
4 years ago |
| 490 |
Generalized Unrelated Machine Scheduling Problem
Shichuan Deng, Jian Li, Yuval Rabani
|
👻
Ghosted
|
cs.DS
|
12 |
4 years ago |
| 491 |
Fast and Simple Sorting Using Partial Information
Bernhard Haeupler, Richard Hladík, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
11 |
2 years ago |
| 492 |
Code Sparsification and its Applications
Sanjeev Khanna, Aaron L Putterman, Madhu Sudan
|
👻
Ghosted
|
cs.DS
|
11 |
2 years ago |
| 493 |
Optimal Bounds on Private Graph Approximation
Jingcheng Liu, Jalaj Upadhyay, Zongrui Zou
|
👻
Ghosted
|
cs.DS
|
11 |
2 years ago |
| 494 |
Optimality of Glauber dynamics for general-purpose Ising model sampling and free energy approximation
Dmitriy Kunisky
|
👻
Ghosted
|
cs.DS
|
11 |
2 years ago |
| 495 |
VC Set Systems in Minor-free (Di)Graphs and Applications
Hung Le, Christian Wulff-Nilsen
|
👻
Ghosted
|
cs.DS
|
11 |
3 years ago |
| 496 |
A Local Search Framework for Experimental Design
Lap Chi Lau, Hong Zhou
|
👻
Ghosted
|
cs.DS
|
11 |
5 years ago |
| 497 |
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints
Janardhan Kulkarni, Shi Li, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
11 |
6 years ago |
| 498 |
Towards PTAS for Precedence Constrained Scheduling via Combinatorial Algorithms
Shi Li
|
👻
Ghosted
|
cs.DS
|
11 |
6 years ago |
| 499 |
Exponential Separations in Local Differential Privacy
Matthew Joseph, Jieming Mao, Aaron Roth
|
👻
Ghosted
|
cs.LG
|
11 |
7 years ago |
| 500 |
Testing Halfspaces over Rotation-Invariant Distributions
Nathaniel Harms
|
👻
Ghosted
|
cs.DS
|
11 |
7 years ago |