| 751 |
A PTAS for $\ell_p$-Low Rank Approximation
Frank Ban, Vijay Bhattiprolu, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
0 |
8 years ago |
| 752 |
A $(4+ε)$-approximation for $k$-connected subgraphs
Zeev Nutov
|
👻
Ghosted
|
cs.DS
|
0 |
7 years ago |
| 753 |
New $(α,β)$ Spanners and Hopsets
Uri Ben-Levy, Merav Parter
|
👻
Ghosted
|
cs.DS
|
0 |
7 years ago |
| 754 |
The Local Information Cost of Distributed Graph Spanners
Peter Robinson
|
👻
Ghosted
|
cs.DC
|
0 |
6 years ago |
| 755 |
Optimal $\ell_1$ Column Subset Selection and a Fast PTAS for Low Rank Approximation
Arvind V. Mahankali, David P. Woodruff
|
👻
Ghosted
|
cs.DS
|
0 |
6 years ago |
| 756 |
A Lower Bound for Dynamic Fractional Cascading
Peyman Afshani
|
👻
Ghosted
|
cs.DS
|
0 |
5 years ago |
| 757 |
Improved Shortest Path Restoration Lemmas for Multiple Edge Failures: Trade-offs Between Fault-tolerance and Subpaths
Greg Bodwin, Lily Wang
|
👻
Ghosted
|
cs.DS
|
0 |
3 years ago |
| 758 |
Sorting and Selection in Rounds with Adversarial Comparisons
Chris Trevisan
|
👻
Ghosted
|
cs.DS
|
0 |
2 years ago |
| 759 |
Tree Containment Above Minimum Degree is FPT
Fedor V. Fomin, Petr A. Golovach, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
0 |
2 years ago |
| 760 |
Unweighted Layered Graph Traversal: Passing a Crown via Entropy Maximization
Xingjian Bai, Christian Coester, Romain Cosson
|
👻
Ghosted
|
cs.DS
|
0 |
2 years ago |
| 761 |
Unbreakable Decomposition in Close-to-Linear Time
Aditya Anand, Euiwoong Lee, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
0 |
2 years ago |
| 762 |
Faster algorithms for packing forests in graphs and related problems
Pavel Arkhipov, Vladimir Kolmogorov
|
👻
Ghosted
|
cs.DS
|
0 |
1 year ago |
| 763 |
Even Faster $(Δ+ 1)$-Edge Coloring via Shorter Multi-Step Vizing Chains
Sayan Bhattacharya, Martín Costa, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
0 |
1 year ago |
| 764 |
Streaming and Communication Complexity of Load-Balancing via Matching Contractors
Sepehr Assadi, Aaron Bernstein, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
0 |
1 year ago |
| 765 |
The Complexity of Dynamic LZ77 is $\tildeΘ(n^{2/3})$
Itai Boneh, Shay Golan, Matan Kraus
|
👻
Ghosted
|
cs.DS
|
0 |
1 year ago |
| 766 |
A $(2+\varepsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
|
👻
Ghosted
|
cs.DS
|
0 |
10 months ago |