| 651 |
Approximating Traveling Salesman Problems Using a Bridge Lemma
Martin Böhm, Zachary Friggstad, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 652 |
A Lower Bound for Light Spanners in General Graphs
Greg Bodwin, Jeremy Flics
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 653 |
Near-optimal hierarchical matrix approximation from matrix-vector products
Tyler Chen, Feyza Duman Keles, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 654 |
Congestion-Approximators from the Bottom Up
Jason Li, Satish Rao, Di Wang
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 655 |
Quasi-Monte Carlo Beyond Hardy-Krause
Nikhil Bansal, Haotian Jiang
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 656 |
The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints
Sven Jäger, Alexander Lindermayr, Nicole Megow
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 657 |
Fixed-Parameter Tractability of Hedge Cut
Fedor V. Fomin, Petr A. Golovach, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
4 |
1 year ago |
| 658 |
Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog Costs
Benjamin Moseley, Aidin Niaparast, R. Ravi
|
👻
Ghosted
|
cs.DS
|
4 |
1 year ago |
| 659 |
Stronger adversaries grow cheaper forests: online node-weighted Steiner problems
Sander Borst, Marek Eliáš, Moritz Venzin
|
👻
Ghosted
|
cs.DS
|
4 |
1 year ago |
| 660 |
Approximation Algorithms for Finding Maximum Induced Expanders
Shayan Oveis Gharan, Alireza Rezaei
|
👻
Ghosted
|
cs.DS
|
3 |
10 years ago |
| 661 |
Nearly Tight Bounds for Sandpile Transience on the Grid
David Durfee, Matthew Fahrbach, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
3 |
9 years ago |
| 662 |
A new algorithm for fast generalized DFTs
Chloe Ching-Yun Hsu, Chris Umans
|
👻
Ghosted
|
cs.DS
|
3 |
9 years ago |
| 663 |
Maximum Integer Flows in Directed Planar Graphs with Multiple Sources and Sinks and Vertex Capacities
Yipu Wang
|
👻
Ghosted
|
cs.DS
|
3 |
8 years ago |
| 664 |
Reconstruction under outliers for Fourier-sparse functions
Xue Chen, Anindya De
|
👻
Ghosted
|
cs.DS
|
3 |
7 years ago |
| 665 |
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels
T-H. Hubert Chan, Zhibin Liang, ... (+2 more)
|
👻
Ghosted
|
cs.IT
|
3 |
6 years ago |
| 666 |
Online Generalized Network Design Under (Dis)Economies of Scale
Viswanath Nagarajan, Lily Wang
|
👻
Ghosted
|
cs.DS
|
3 |
6 years ago |
| 667 |
Polyhedral value iteration for discounted games and energy games
Alexander Kozachinskiy
|
👻
Ghosted
|
cs.DS
|
3 |
6 years ago |
| 668 |
Selectable Heaps and Optimal Lazy Search Trees
Bryce Sandlund, Lingyi Zhang
|
👻
Ghosted
|
cs.DS
|
3 |
5 years ago |
| 669 |
Stronger 3SUM-Indexing Lower Bounds
Eldon Chung, Kasper Green Larsen
|
👻
Ghosted
|
cs.DS
|
3 |
4 years ago |
| 670 |
Fast Discrepancy Minimization with Hereditary Guarantees
Kasper Green Larsen
|
👻
Ghosted
|
cs.DS
|
3 |
4 years ago |
| 671 |
Approximate Trace Reconstruction from a Single Trace
Xi Chen, Anindya De, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
3 |
3 years ago |
| 672 |
Query Complexity of the Metric Steiner Tree Problem
Yu Chen, Sanjeev Khanna, Zihan Tan
|
👻
Ghosted
|
cs.DS
|
3 |
3 years ago |
| 673 |
Shortest Cycles With Monotone Submodular Costs
Fedor V. Fomin, Petr A. Golovach, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
3 |
3 years ago |
| 674 |
Online Min-Max Paging
Ashish Chiplunkar, Monika Henzinger, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
3 |
3 years ago |
| 675 |
Non-Stochastic CDF Estimation Using Threshold Queries
Princewill Okoroafor, Vaishnavi Gupta, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
3 |
3 years ago |
| 676 |
(Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flow
Ohad Trabelsi
|
👻
Ghosted
|
cs.DS
|
3 |
3 years ago |
| 677 |
Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data
Rajat De, Dominik Kempa
|
👻
Ghosted
|
cs.DS
|
3 |
3 years ago |
| 678 |
Tight Lower Bound on Equivalence Testing in Conditional Sampling Model
Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar
|
👻
Ghosted
|
cs.DS
|
3 |
3 years ago |
| 679 |
Local Lipschitz Filters for Bounded-Range Functions with Applications to Arbitrary Real-Valued Functions
Jane Lange, Ephraim Linder, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
3 |
3 years ago |
| 680 |
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable
Sayan Bandyapadhyay, William Lochet, ... (+3 more)
|
👻
Ghosted
|
cs.CG
|
3 |
2 years ago |
| 681 |
The Cost of Parallelizing Boosting
Xin Lyu, Hongxun Wu, Junzhao Yang
|
👻
Ghosted
|
cs.LG
|
3 |
2 years ago |
| 682 |
Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
Yuchen He, Zichun Ye, Chihao Zhang
|
👻
Ghosted
|
cs.LG
|
3 |
2 years ago |
| 683 |
Beating Bellman's Algorithm for Subset Sum
Karl Bringmann, Nick Fischer, Vasileios Nakos
|
👻
Ghosted
|
cs.DS
|
3 |
1 year ago |
| 684 |
Sumsets, 3SUM, Subset Sum: Now for Real!
Nick Fischer
|
👻
Ghosted
|
cs.DS
|
3 |
1 year ago |
| 685 |
Highway Dimension: a Metric View
Andreas Emil Feldmann, Arnold Filtser
|
👻
Ghosted
|
cs.DS
|
3 |
1 year ago |
| 686 |
Balanced Allocation: Patience is not a Virtue
John Augustine, William K. Moses, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
2 |
10 years ago |
| 687 |
Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering Inequalities
Shi Li
|
👻
Ghosted
|
cs.DS
|
2 |
9 years ago |
| 688 |
The Andoni--Krauthgamer--Razenshteyn characterization of sketchable norms fails for sketchable metrics
Subhash Khot, Assaf Naor
|
👻
Ghosted
|
cs.DS
|
2 |
7 years ago |
| 689 |
How to aggregate Top-lists: Approximation algorithms via scores and average ranks
Claire Mathieu, Simon Mauras
|
👻
Ghosted
|
cs.DS
|
2 |
7 years ago |
| 690 |
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs
MohammadHossein Bateni, Alireza Farhadi, MohammadTaghi Hajiaghayi
|
👻
Ghosted
|
cs.DS
|
2 |
7 years ago |
| 691 |
A Lower Bound on Cycle-Finding in Sparse Digraphs
Xi Chen, Tim Randolph, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
2 |
7 years ago |
| 692 |
Shorter Labels for Routing in Trees
Paweł Gawrychowski, Wojciech Janczewski, Jakub Łopuszański
|
👻
Ghosted
|
cs.DS
|
2 |
6 years ago |
| 693 |
Directed Shortest Paths via Approximate Cost Balancing
James B. Orlin, László A. Végh
|
👻
Ghosted
|
cs.DS
|
2 |
6 years ago |
| 694 |
Instability of backoff protocols with arbitrary arrival rates
Leslie Ann Goldberg, John Lapinskas
|
👻
Ghosted
|
cs.DS
|
2 |
4 years ago |
| 695 |
A Nearly Time-Optimal Distributed Approximation of Minimum Cost $k$-Edge-Connected Spanning Subgraph
Michal Dory, Mohsen Ghaffari
|
👻
Ghosted
|
cs.DS
|
2 |
3 years ago |
| 696 |
Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness Constraints
Varun Suriyanarayana, Varun Sivashankar, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
2 |
3 years ago |
| 697 |
Adjacency Sketches in Adversarial Environments
Moni Naor, Eugene Pekel
|
👻
Ghosted
|
cs.DS
|
2 |
3 years ago |
| 698 |
Approximating Subset Sum Ratio faster than Subset Sum
Karl Bringmann
|
👻
Ghosted
|
cs.DS
|
2 |
2 years ago |
| 699 |
Fast Algorithms for Separable Linear Programs
Sally Dong, Gramoz Goranci, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
2 |
2 years ago |
| 700 |
Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
Swati Gupta, Jai Moondra, Mohit Singh
|
👻
Ghosted
|
cs.DS
|
2 |
2 years ago |