Imagen de Portada

Faster Algorithm for Structured John Ellipsoid Computation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cao, Yang, Li, Xiaoyu, Song, Zhao, Yang, Xin, Zhou, Tianyi
Formato:	Preprint
Publicado:	2022
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Quantum Speedups for Approximating the John Ellipsoid
por: Li, Xiaoyu, et al.
Publicado: (2024)

Fast John Ellipsoid Computation with Differential Privacy Optimization
por: Li, Xiaoyu, et al.
Publicado: (2024)

Faster Algorithms for Dual-Failure Replacement Paths
por: Chechik, Shiri, et al.
Publicado: (2024)

John Ellipsoids via Lazy Updates
por: Woodruff, David P., et al.
Publicado: (2025)

Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance
por: Song, Zhao, et al.
Publicado: (2022)

Faster Deterministic Streaming Vertex Coloring
por: Chechik, Shiri, et al.
Publicado: (2026)

Faster Approximation Algorithms for k-Center via Data Reduction
por: Filtser, Arnold, et al.
Publicado: (2025)

A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
por: Chuzhoy, Julia, et al.
Publicado: (2026)

Simple and Faster Algorithms for Knapsack
por: He, Qizheng, et al.
Publicado: (2023)

Faster Algorithms for Graph Monopolarity
por: Philip, Geevarghese, et al.
Publicado: (2024)

A Faster $k$-means++ Algorithm
por: Liang, Jiehao, et al.
Publicado: (2022)

Faster Relational Algorithms Using Geometric Data Structures
por: Esmailpour, Aryan, et al.
Publicado: (2026)

Faster Combinatorial k-Clique Algorithms
por: Abboud, Amir, et al.
Publicado: (2024)

Faster Algorithms for Longest Common Substring
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2021)

Faster Algorithms for Shortest Unique or Absent Substrings
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2026)

Faster Algorithms for Text-to-Pattern Hamming Distances
por: Chan, Timothy M., et al.
Publicado: (2023)

A Faster Algorithm for Constrained Correlation Clustering
por: Fischer, Nick, et al.
Publicado: (2025)

A Faster Algorithm for Pigeonhole Equal Sums
por: Jin, Ce, et al.
Publicado: (2024)

Dynamic Kernel Graph Sparsifiers
por: Cao, Yang, et al.
Publicado: (2022)

Faster Vizing and Near-Vizing Edge Coloring Algorithms
por: Assadi, Sepehr
Publicado: (2024)

Faster Algorithms for Schatten-p Low Rank Approximation
por: Kacham, Praneeth, et al.
Publicado: (2024)

Improved Algorithms for Effective Resistance Computation on Graphs
por: Yang, Yichun, et al.
Publicado: (2025)

Even Faster $(Δ+ 1)$-Edge Coloring via Shorter Multi-Step Vizing Chains
por: Bhattacharya, Sayan, et al.
Publicado: (2024)

Faster Space-Efficient STR-IC-LCS Computation
por: Yonemoto, Yuki, et al.
Publicado: (2022)

Faster and Simpler Online Computation of String Net Frequency
por: Inenaga, Shunsuke
Publicado: (2024)

Faster Algorithms for $(2k-1)$-Stretch Distance Oracles
por: Kadria, Avi, et al.
Publicado: (2025)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
por: Łącki, Jakub, et al.
Publicado: (2025)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
por: Ashvinkumar, Vikrant, et al.
Publicado: (2024)

Faster $(Δ+ 1)$-Edge Coloring: Breaking the $m \sqrt{n}$ Time Barrier
por: Bhattacharya, Sayan, et al.
Publicado: (2024)

A Faster Deterministic Algorithm for Kidney Exchange via Representative Set
por: Tian, Kangyi, et al.
Publicado: (2026)

Faster Algorithms for Average-Case Orthogonal Vectors and Closest Pair Problems
por: Alman, Josh, et al.
Publicado: (2024)

A Faster Algorithm for Maximum Weight Matching on Unrestricted Bipartite Graphs
por: Kwok, Shawxing
Publicado: (2025)

Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime
por: Kociumaka, Tomasz, et al.
Publicado: (2025)

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments
por: Kumar, Mithilesh, et al.
Publicado: (2024)

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
por: Esmer, Barış Can, et al.
Publicado: (2024)

Faster Algorithm for Second (s,t)-mincut and Breaking Quadratic barrier for Dual Edge Sensitivity for (s,t)-mincut
por: Baswana, Surender, et al.
Publicado: (2025)

Faster Fixed Parameter Tractable Algorithms for Counting Markov Equivalence Classes with Special Skeletons
por: Sharma, Vidya Sagar
Publicado: (2023)

Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More
por: Jin, Ce, et al.
Publicado: (2024)

A Faster Deterministic Approximation Algorithm for TTP-2
por: Kanaya, Yuga, et al.
Publicado: (2023)

Discrepancy Minimization in Input-Sparsity Time
por: Deng, Yichuan, et al.
Publicado: (2022)