Imagen de Portada

GTA -- An ATSP Method: Shifting the Bottleneck from Algorithm to RAM

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Nakhle, Wissam
Formato:	Preprint
Publicado:	2025
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

Vantage Point Selection Algorithms for Bottleneck Capacity Estimation
por: Ashvinkumar, Vikrant, et al.
Publicado: (2025)

Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
por: Chen, Lin, et al.
Publicado: (2026)

Compressing Dynamic Fully Indexable Dictionaries in Word-RAM
por: Domingues, Gabriel Marques
Publicado: (2026)

Dynamic Range Minimum Queries on the Ultra-Wide Word RAM
por: Bille, Philip, et al.
Publicado: (2024)

On the Hardness Hierarchy for the $O(n \sqrt{\log n})$ Complexity in the Word RAM
por: Kempa, Dominik, et al.
Publicado: (2025)

Algorithms for Optimally Shifting Intervals under Intersection Graph Models
por: Honorato-Droguett, Nicolás, et al.
Publicado: (2023)

Contiguous Graph Partitioning For Optimal Total Or Bottleneck Communication
por: Ahrens, Willow
Publicado: (2020)

Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck
por: Kuszmaul, William, et al.
Publicado: (2025)

The Kinetic Hourglass Data Structure for Computing the Bottleneck Distance of Dynamic Data
por: Munch, Elizabeth, et al.
Publicado: (2025)

Efficient and Provable Algorithms for Covariate Shift
por: Adil, Deeksha, et al.
Publicado: (2025)

Tolerant Algorithms for Learning with Arbitrary Covariate Shift
por: Goel, Surbhi, et al.
Publicado: (2024)

Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions
por: Bansal, Ishan, et al.
Publicado: (2022)

PtrHash: Minimal Perfect Hashing at RAM Throughput
por: Koerkamp, Ragnar Groot
Publicado: (2025)

An O(1) Space Algorithm for N-Dimensional Tensor Rotation: A Generalization of the Reversal Method
por: Chen, Dexin
Publicado: (2025)

Signal-Aware Workload Shifting Algorithms with Uncertainty-Quantified Predictors
por: Johnson, Ezra, et al.
Publicado: (2025)

Maximizing Reachability via Shifting of Temporal Paths
por: Deligkas, Argyrios, et al.
Publicado: (2026)

Minimizing Reachability Times on Temporal Graphs via Shifting Labels
por: Deligkas, Argyrios, et al.
Publicado: (2021)

Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
por: Chandra, Rishi, et al.
Publicado: (2024)

Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds
por: Klivans, Adam R., et al.
Publicado: (2024)

ShiftDTW: adapting the DTW metric for cyclic time series clustering
por: Foulon, Lucas, et al.
Publicado: (2024)

Streaming Algorithms via Local Algorithms for Maximum Directed Cut
por: Saxena, Raghuvansh R., et al.
Publicado: (2024)

A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation
por: Crane, Alex, et al.
Publicado: (2026)

Random-Shift Revisited: Tight Approximations for Tree Embeddings and L1-Oblivious Routings
por: Kyng, Rasmus, et al.
Publicado: (2025)

Methodology of Algorithm Engineering
por: Mendling, Jan, et al.
Publicado: (2023)

Optimal Extended Formulations from Optimal Dynamic Programming Algorithms
por: Oliveira, Mateus de Oliveira, et al.
Publicado: (2026)

The Kernighan-Lin Search Algorithm
por: Dasdan, Ali
Publicado: (2025)

Streaming Algorithms for Network Design
por: Chekuri, Chandra, et al.
Publicado: (2025)

Distributed Algorithms for Euclidean Clustering
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

The Impact of Approximation on Algorithmic Progress
por: Li, Jeffery, et al.
Publicado: (2026)

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

A Coalgebraic Dijkstra Algorithm
por: Sanada, Takahiro, et al.
Publicado: (2026)

Algorithmic Extensions of Dirac's Theorem
por: Fomin, Fedor V., et al.
Publicado: (2020)

Engineering Edge Orientation Algorithms
por: Reinstädtler, H., et al.
Publicado: (2024)

Risk-Sensitive Online Algorithms
por: Christianson, Nicolas, et al.
Publicado: (2024)

Quantum Algorithm for Jaccard Similarity
por: Puram, Varun, et al.
Publicado: (2024)

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

Tree Proof-of-Position Algorithms
por: Kharman, Aida Manzano, et al.
Publicado: (2024)

Streaming Algorithms for Connectivity Augmentation
por: Jin, Ce, et al.
Publicado: (2024)

Efficient Online Sensitivity Analysis For The Injective Bottleneck Path Problem
por: Kaymakov, Kirill V., et al.
Publicado: (2024)

An Exact Algorithm for the Unanimous Vote Problem
por: Keles, Feyza Duman, et al.
Publicado: (2025)