Saved in:
| Main Authors: | Li, Xiaoyu, Song, Zhao, Yu, Junwei |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.14018 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Fast John Ellipsoid Computation with Differential Privacy Optimization
by: Li, Xiaoyu, et al.
Published: (2024)
by: Li, Xiaoyu, et al.
Published: (2024)
Faster Algorithm for Structured John Ellipsoid Computation
by: Cao, Yang, et al.
Published: (2022)
by: Cao, Yang, et al.
Published: (2022)
Quantum Speedup for Spectral Approximation of Kronecker Products
by: Gao, Yeqi, et al.
Published: (2024)
by: Gao, Yeqi, et al.
Published: (2024)
John Ellipsoids via Lazy Updates
by: Woodruff, David P., et al.
Published: (2025)
by: Woodruff, David P., et al.
Published: (2025)
Quantum Speedup for Hypergraph Sparsification
by: Liu, Chenghua, et al.
Published: (2025)
by: Liu, Chenghua, et al.
Published: (2025)
Quantum Speedups for Bayesian Network Structure Learning
by: Harviainen, Juha, et al.
Published: (2023)
by: Harviainen, Juha, et al.
Published: (2023)
Quantum Speedup for Sampling Random Spanning Trees
by: Apers, Simon, et al.
Published: (2025)
by: Apers, Simon, et al.
Published: (2025)
Lawler-Moore Speedups via Additive Combinatorics
by: Bringmann, Karl, et al.
Published: (2026)
by: Bringmann, Karl, et al.
Published: (2026)
Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
by: Caroppo, Susanna, et al.
Published: (2025)
by: Caroppo, Susanna, et al.
Published: (2025)
Asymptotic Rank Speedup Theorems, Revisited
by: Alman, Josh, et al.
Published: (2026)
by: Alman, Josh, et al.
Published: (2026)
Quadratic Speedup for Computing Contraction Fixed Points
by: Chen, Xi, et al.
Published: (2026)
by: Chen, Xi, et al.
Published: (2026)
On Speedups for Convex Optimization via Quantum Dynamics
by: Chakrabarti, Shouvanik, et al.
Published: (2025)
by: Chakrabarti, Shouvanik, et al.
Published: (2025)
R-enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies
by: Kimura, Kotaro, et al.
Published: (2025)
by: Kimura, Kotaro, et al.
Published: (2025)
Discrepancy Minimization in Input-Sparsity Time
by: Deng, Yichuan, et al.
Published: (2022)
by: Deng, Yichuan, et al.
Published: (2022)
An Entropy-Governed Speedup for Quantum Algorithms on Local Hamiltonians
by: Mataraarachchi, Ranitha, et al.
Published: (2026)
by: Mataraarachchi, Ranitha, et al.
Published: (2026)
Quantum Speedups for Group Relaxations of Integer Linear Programs
by: Augustino, Brandon, et al.
Published: (2026)
by: Augustino, Brandon, et al.
Published: (2026)
Dynamic Kernel Graph Sparsifiers
by: Cao, Yang, et al.
Published: (2022)
by: Cao, Yang, et al.
Published: (2022)
Quantum Speedups for Derivative Pricing Beyond Black-Scholes
by: Herman, Dylan, et al.
Published: (2026)
by: Herman, Dylan, et al.
Published: (2026)
Sublinear Time Quantum Algorithm for Attention Approximation
by: Song, Zhao, et al.
Published: (2026)
by: Song, Zhao, et al.
Published: (2026)
Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms
by: Mo, Guanlin, et al.
Published: (2024)
by: Mo, Guanlin, et al.
Published: (2024)
An Improved Approximation Algorithm for Metric Triangle Packing
by: Zhao, Jingyang, et al.
Published: (2024)
by: Zhao, Jingyang, et al.
Published: (2024)
Improved Approximations for Dial-a-Ride Problems
by: Zhao, Jingyang, et al.
Published: (2026)
by: Zhao, Jingyang, et al.
Published: (2026)
An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
by: Zhao, Jingyang, et al.
Published: (2025)
by: Zhao, Jingyang, et al.
Published: (2025)
Improved Approximations for the Unsplittable Capacitated Vehicle Routing Problem
by: Zhao, Jingyang, et al.
Published: (2026)
by: Zhao, Jingyang, et al.
Published: (2026)
Approximation Algorithms for Packing Cycles and Paths in Complete Graphs
by: Zhao, Jingyang, et al.
Published: (2023)
by: Zhao, Jingyang, et al.
Published: (2023)
Multidepot Capacitated Vehicle Routing with Improved Approximation Guarantees
by: Zhao, Jingyang, et al.
Published: (2023)
by: Zhao, Jingyang, et al.
Published: (2023)
Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity
by: Zhao, Jingyang, et al.
Published: (2022)
by: Zhao, Jingyang, et al.
Published: (2022)
An Improved Approximation Algorithm for Maximum Weight 3-Path Packing
by: Zhao, Jingyang, et al.
Published: (2025)
by: Zhao, Jingyang, et al.
Published: (2025)
Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands
by: Zhao, Jingyang, et al.
Published: (2025)
by: Zhao, Jingyang, et al.
Published: (2025)
Improved Approximation for Ranking on General Graphs
by: Derakhshan, Mahsa, et al.
Published: (2025)
by: Derakhshan, Mahsa, et al.
Published: (2025)
Parameterized Approximation Algorithms for TSP on Non-Metric Graphs
by: Zhao, Jingyang, et al.
Published: (2025)
by: Zhao, Jingyang, et al.
Published: (2025)
Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
by: Zhao, Jingyang, et al.
Published: (2025)
by: Zhao, Jingyang, et al.
Published: (2025)
A Classical Quadratic Speedup for Planted $k$XOR
by: Gupta, Meghal, et al.
Published: (2025)
by: Gupta, Meghal, et al.
Published: (2025)
Polylogarithmic Approximation for Robust s-t Path
by: Li, Shi, et al.
Published: (2023)
by: Li, Shi, et al.
Published: (2023)
Approximating Small Sparse Cuts
by: Anand, Aditya, et al.
Published: (2024)
by: Anand, Aditya, et al.
Published: (2024)
Learning Confidence Ellipsoids and Applications to Robust Subspace Recovery
by: Gao, Chao, et al.
Published: (2025)
by: Gao, Chao, et al.
Published: (2025)
Hardness and Approximation Algorithms for Balanced Districting Problems
by: Dharangutte, Prathamesh, et al.
Published: (2025)
by: Dharangutte, Prathamesh, et al.
Published: (2025)
Congestion-Approximators from the Bottom Up
by: Li, Jason, et al.
Published: (2024)
by: Li, Jason, et al.
Published: (2024)
The Impact of Approximation on Algorithmic Progress
by: Li, Jeffery, et al.
Published: (2026)
by: Li, Jeffery, et al.
Published: (2026)
Faster Weak Expander Decompositions and Approximate Max Flow
by: Fleischmann, Henry, et al.
Published: (2025)
by: Fleischmann, Henry, et al.
Published: (2025)
Similar Items
-
Fast John Ellipsoid Computation with Differential Privacy Optimization
by: Li, Xiaoyu, et al.
Published: (2024) -
Faster Algorithm for Structured John Ellipsoid Computation
by: Cao, Yang, et al.
Published: (2022) -
Quantum Speedup for Spectral Approximation of Kronecker Products
by: Gao, Yeqi, et al.
Published: (2024) -
John Ellipsoids via Lazy Updates
by: Woodruff, David P., et al.
Published: (2025) -
Quantum Speedup for Hypergraph Sparsification
by: Liu, Chenghua, et al.
Published: (2025)