Image de couverture de livre

Faster Approximate Fixed Points of $\ell_\infty$-Contractions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Feodorov, Andrei, Haslebacher, Sebastian
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On Finding $\ell$-th Smallest Perfect Matchings
par: Maalouly, Nicolas El, et autres
Publié: (2025)

A Levelset Algorithm for 3D-Tarski
par: Haslebacher, Sebastian, et autres
Publié: (2025)

Acceleration Meets Inverse Maintenance: Faster $\ell_{\infty}$-Regression
par: Adil, Deeksha, et autres
Publié: (2024)

ARRIVAL: Recursive Framework & $\ell_1$-Contraction
par: Haslebacher, Sebastian
Publié: (2025)

Quadratic Speedup for Computing Contraction Fixed Points
par: Chen, Xi, et autres
Publié: (2026)

Faster Approximate Linear Matroid Intersection
par: Terao, Tatsuya
Publié: (2026)

Approximation Algorithms for $\ell_p$-Shortest Path and $\ell_p$-Group Steiner Tree
par: Makarychev, Yury, et autres
Publié: (2024)

Approximating Tensor Network Contraction with Sketches
par: Heddes, Mike, et autres
Publié: (2026)

Faster Algorithms for Schatten-p Low Rank Approximation
par: Kacham, Praneeth, et autres
Publié: (2024)

Faster Weak Expander Decompositions and Approximate Max Flow
par: Fleischmann, Henry, et autres
Publié: (2025)

Faster Approximation Algorithms for k-Center via Data Reduction
par: Filtser, Arnold, et autres
Publié: (2025)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
par: Łącki, Jakub, et autres
Publié: (2025)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
par: Ashvinkumar, Vikrant, et autres
Publié: (2024)

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

Path Contraction Faster than $2^n$
par: Agrawal, Akanksha, et autres
Publié: (2025)

Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
par: Chen, Yong, et autres
Publié: (2025)

Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs
par: Dong, Sally, et autres
Publié: (2023)

A Faster Deterministic Approximation Algorithm for TTP-2
par: Kanaya, Yuga, et autres
Publié: (2023)

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity
par: Zhao, Jingyang, et autres
Publié: (2022)

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
par: Esmer, Barış Can, et autres
Publié: (2024)

Faster Approximation Scheme for Euclidean $k$-TSP
par: van Wijland, Ernest, et autres
Publié: (2023)

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
par: Esmer, Barış Can, et autres
Publié: (2022)

A $2\ell k$ Kernel for $\ell$-Component Order Connectivity
par: Kumar, Mithilesh, et autres
Publié: (2016)

$\ell_2/\ell_2$ Sparse Recovery via Weighted Hypergraph Peeling
par: Fischer, Nick, et autres
Publié: (2025)

Ridge Leverage Score Sampling for $\ell_p$ Subspace Approximation
par: Woodruff, David P., et autres
Publié: (2024)

Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
par: Davies, Sami, et autres
Publié: (2023)

A Faster Generalized Two-Stage Approximate Top-K
par: Samaga, Yashas, et autres
Publié: (2025)

Faster Parameterized Vertex Multicut
par: Chu, Huairui, et autres
Publié: (2026)

Simple and Faster Algorithms for Knapsack
par: He, Qizheng, et autres
Publié: (2023)

Faster optimal univariate microgaggregation
par: Stamm, Felix I., et autres
Publié: (2024)

Faster Algorithms for Graph Monopolarity
par: Philip, Geevarghese, et autres
Publié: (2024)

Faster Pseudo-Deterministic Minimum Cut
par: Kenneth-Mordoch, Yotam
Publié: (2026)

Faster Deterministic Streaming Vertex Coloring
par: Chechik, Shiri, et autres
Publié: (2026)

Faster Edge Coloring by Partition Sieving
par: Akmal, Shyan, et autres
Publié: (2025)

Faster Combinatorial k-Clique Algorithms
par: Abboud, Amir, et autres
Publié: (2024)

Faster Global Minimum Cut with Predictions
par: Moseley, Benjamin, et autres
Publié: (2025)

Faster Algorithms for Longest Common Substring
par: Charalampopoulos, Panagiotis, et autres
Publié: (2021)

Dynamic Metric Embedding into $\ell_p$ Space
par: Banihashem, Kiarash, et autres
Publié: (2024)

Computing a Fixed Point of Contraction Maps in Polynomial Queries
par: Chen, Xi, et autres
Publié: (2024)

Faster Algorithms for Shortest Unique or Absent Substrings
par: Charalampopoulos, Panagiotis, et autres
Publié: (2026)