:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Bertram, Christian
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2504.17716
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Parameterized Approximation Algorithms for TSP on Non-Metric Graphs
par: Zhao, Jingyang, et autres
Publié: (2025)

Approximation Schemes for Orienteering and Deadline TSP in Doubling Metrics
par: Ren, Kinter, et autres
Publié: (2024)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
par: Kalavas, Andreas, et autres
Publié: (2025)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
par: Kalavas, Andreas, et autres
Publié: (2025)

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth
par: Koh, Zhuan Khye, et autres
Publié: (2024)

Online Monotone Metric Embeddings
par: Coester, Christian, et autres
Publié: (2026)

Smoothed Analysis of Online Metric Problems
par: Coester, Christian, et autres
Publié: (2025)

Online 3-Taxi on General Metrics
par: Coester, Christian, et autres
Publié: (2025)

Online sorting and online TSP: randomized, stochastic, and high-dimensional
par: Abrahamsen, Mikkel, et autres
Publié: (2024)

Dual Charging for Half-Integral TSP
par: Klein, Nathan, et autres
Publié: (2025)

Approximating Prize-Collecting Variants of TSP
par: Alimi, Morteza, et autres
Publié: (2024)

4/3-Approximation of Graphic TSP
par: Çivril, Ali
Publié: (2023)

Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model
par: Alipour, Sharareh, et autres
Publié: (2025)

Personalized PageRank Estimation in Undirected Graphs
par: Bertram, Christian, et autres
Publié: (2026)

Improved FPT Approximation for Non-metric TSP
par: Bampis, Evripidis, et autres
Publié: (2024)

Sublinear Algorithms for TSP via Path Covers
par: Behnezhad, Soheil, et autres
Publié: (2023)

Matroid-Based TSP Rounding for Half-Integral Solutions
par: Gupta, Anupam, et autres
Publié: (2021)

Waiting is not easy but worth it: the online TSP on the line revisited
par: Chen, Pei-Chuan, et autres
Publié: (2019)

Balanced TSP partitioning
par: Berendsohn, Benjamin Aram, et autres
Publié: (2025)

Better approximation guarantee for Asymmetric TSP
par: Vygen, Jens
Publié: (2026)

Approximating Asymmetric A Priori TSP beyond the Adaptivity Gap
par: Christalla, Manuel, et autres
Publié: (2025)

A Better-Than-1.6-Approximation for Prize-Collecting TSP
par: Blauth, Jannis, et autres
Publié: (2023)

Online Metric Matching: Beyond the Worst Case
par: Yang, Mingwei, et autres
Publié: (2024)

A Lower Bound for the Max Entropy Algorithm for TSP
par: Jin, Billy, et autres
Publié: (2023)

A Linear Time Gap-ETH-Tight Approximation Scheme for Euclidean TSP
par: Mömke, Tobias, et autres
Publié: (2024)

A $(5/3+ε)$-Approximation for Tricolored Non-crossing Euclidean TSP
par: Baligács, Júlia, et autres
Publié: (2024)

Smoothed Analysis of Online Metric Matching with a Single Sample: Beyond Metric Distortion
par: Li, Yingxi, et autres
Publié: (2025)

Lower bounds for the universal TSP on the plane
par: Kravaris, Cosmas
Publié: (2024)

Dynamic Meta-Kernelization
par: Bertram, Christian, et autres
Publié: (2025)

Mind the Gap. Doubling Constant Parametrization of Weighted Problems: TSP, Max-Cut, and More
par: Stoian, Mihail
Publié: (2026)

A $(\frac32+\frac1{\mathrm{e}})$-Approximation Algorithm for Ordered TSP
par: Armbruster, Susanne, et autres
Publié: (2024)

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

Algorithmic strategies for finding the best TSP 2-OPT move in average sub-quadratic time
par: Lancia, Giuseppe, et autres
Publié: (2024)

Improved space-time tradeoff for TSP via extremal set systems
par: Dallant, Justin, et autres
Publié: (2026)

Estimating Random-Walk Probabilities in Directed Graphs
par: Bertram, Christian, et autres
Publié: (2025)

A Survey of Approximability Results for Traveling Salesman Problems using the TSP-T3CO Definition Scheme
par: Saller, Sophia, et autres
Publié: (2023)

Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds
par: Bartal, Yair, et autres
Publié: (2024)

TSP Escapes the $O(2^n n^2)$ Curse
par: Stoian, Mihail
Publié: (2024)

Solving a Random Asymmetric TSP Exactly in Quasi-Polynomial Time w.h.p
par: Bell, Tolson, et autres
Publié: (2023)

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2026)