Imagen de Portada

An Almost-Optimal Upper Bound on the Push Number of the Torus Puzzle

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Caporrella, Matteo, Leucci, Stefano
Formato:	Preprint
Publicado:	2026
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

An Optimal Sorting Algorithm for Persistent Random Comparison Faults
por: Geissmann, Barbara, et al.
Publicado: (2025)

Graph Spanners for Group Steiner Distances
por: Bilò, Davide, et al.
Publicado: (2024)

Temporal queries for dynamic temporal forests
por: Bilò, Davide, et al.
Publicado: (2024)

Almost-Optimal Upper and Lower Bounds for Clustering in Low Dimensional Euclidean Spaces
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets
por: Bilò, Davide, et al.
Publicado: (2024)

On the (In)Approximability of the Monitoring Edge Geodetic Set Problem
por: Bilò, Davide, et al.
Publicado: (2025)

Almost Tight Bounds for Online Hypergraph Matching
por: Tröbst, Thorben, et al.
Publicado: (2024)

Expander Decomposition with Almost Optimal Overhead
por: Bansal, Nikhil, et al.
Publicado: (2026)

Almost-Optimal Sublinear Additive Spanners
por: Tan, Zihan, et al.
Publicado: (2023)

Almost Tight Bounds for Differentially Private Densest Subgraph
por: Dinitz, Michael, et al.
Publicado: (2023)

Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs
por: Khanna, Sanjeev, et al.
Publicado: (2024)

Almost Optimal Fully Dynamic $k$-Center Clustering with Recourse
por: Bhattacharya, Sayan, et al.
Publicado: (2024)

(Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flow
por: Trabelsi, Ohad
Publicado: (2023)

Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method
por: Huiberts, Sophie, et al.
Publicado: (2022)

Two New Upper Bounds for the Maximum k-plex Problem
por: Zheng, Jiongzhi, et al.
Publicado: (2023)

Subsequences With Generalised Gap Constraints: Upper and Lower Complexity Bounds
por: Manea, Florin, et al.
Publicado: (2024)

Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds
por: Hwang, Samuel, et al.
Publicado: (2024)

Random Access in Grammar-Compressed Strings: Optimal Trade-Offs in Almost All Parameter Regimes
por: Duyster, Anouk, et al.
Publicado: (2026)

Parallel $(1+ε)$-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work
por: Haeupler, Bernhard, et al.
Publicado: (2025)

Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions & Near-Optimal Separations
por: Blikstad, Joakim, et al.
Publicado: (2025)

Nearly Optimal Bounds for Stochastic Online Sorting
por: Hu, Yang
Publicado: (2025)

An Optimal Density Bound for Discretized Point Patrolling
por: Mishra, Ahan
Publicado: (2025)

An Upper Bound on Grothendieck's Constant
por: Heilman, Steven
Publicado: (2026)

Improved Upper Bounds for the Directed Flow-Cut Gap
por: Bodwin, Greg, et al.
Publicado: (2026)

Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness
por: Gribelyuk, Elena, et al.
Publicado: (2025)

Distances in Planar Graphs are Almost for Free!
por: Mozes, Shay, et al.
Publicado: (2026)

Deterministic Mincut in Almost-Linear Time
por: Li, Jason
Publicado: (2021)

Almost succinct representation of maximal palindromes
por: Mieno, Takuya, et al.
Publicado: (2025)

Network Unreliability in Almost-Linear Time
por: Cen, Ruoxu, et al.
Publicado: (2025)

Bounding the Optimal Performance of Online Randomized Primal-Dual Methods
por: Xu, Pan
Publicado: (2025)

Additive Spanner Lower Bounds with Optimal Inner Graph Structure
por: Bodwin, Greg, et al.
Publicado: (2024)

Optimal Bounds for Distinct Quartics
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2024)

Approximating Directed Connectivity in Almost-Linear Time
por: Quanrud, Kent
Publicado: (2025)

Vizing's Theorem in Deterministic Almost-Linear Time
por: Assadi, Sepehr, et al.
Publicado: (2025)

Almost Linear Size Edit Distance Sketch
por: Koucký, Michal, et al.
Publicado: (2024)

Local Search for Clustering in Almost-linear Time
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2025)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
por: Gahlawat, Harmender, et al.
Publicado: (2025)

Nearly Optimal Bounds for Computing Decision Tree Splits in Data Streams
por: Ta, Hoang, et al.
Publicado: (2026)

KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem
por: Jin, Mingming, et al.
Publicado: (2023)

Bellman-Ford in Almost-Linear Time for Dense Graphs
por: Li, George Z., et al.
Publicado: (2026)