Image de couverture de livre

Parameterized Complexity of Directed Traveling Salesman Problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Blažej, Václav, Feldmann, Andreas Emil, Fioravantes, Foivos, Rzążewski, Paweł, Suchý, Ondřej
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms 68Q27
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
par: Bergougnoux, Benjamin, et autres
Publié: (2025)

Parameterized Algorithms for Kidney Exchange
par: Maiti, Arnab, et autres
Publié: (2021)

Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees
par: Bojikian, Narek, et autres
Publié: (2025)

Algorithms for Minimum Membership Dominating Set Problem
par: Reddy, Sangam Balchandar, et autres
Publié: (2024)

Steiner Tree Parameterized by Multiway Cut and Even Less
par: Jansen, Bart M. P., et autres
Publié: (2024)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
par: Heimann, Sophia, et autres
Publié: (2026)

On weighted graph separation problems and flow-augmentation
par: Kim, Eun Jung, et autres
Publié: (2022)

Coordinatewise Balanced Covering for Linear Gain Graphs, with an Application to Coset-List Min-2-Lin over Powers of Two
par: Alpay, Faruk, et autres
Publié: (2026)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
par: Goerigk, Marc, et autres
Publié: (2026)

On the Advice Complexity of Online Unit Clustering
par: Nagy-György, Judit
Publié: (2023)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
par: Heimann, Sophia, et autres
Publié: (2024)

Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares
par: Göbel, Andreas, et autres
Publié: (2025)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
par: Jansen, Klaus, et autres
Publié: (2024)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
par: Liu, Bowen
Publié: (2025)

Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time
par: Agrawal, Akanksha, et autres
Publié: (2024)

Shortest Paths without a Map, but with an Entropic Regularizer
par: Bubeck, Sébastien, et autres
Publié: (2022)

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
par: Blažej, Václav, et autres
Publié: (2024)

A Polynomial-time Algorithm to Solve the Airplane Refueling Problem: the Sequential Search Algorithm
par: Cui, Jinchuan, et autres
Publié: (2022)

On Binary Networked Public Goods Game with Altruism
par: Maiti, Arnab, et autres
Publié: (2022)

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs
par: Feldmann, Andreas Emil, et autres
Publié: (2024)

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors
par: Gribelyuk, Elena, et autres
Publié: (2024)

Efficient Processing of Subsequent Densest Subgraph Query
par: Hung, Chia-Yang, et autres
Publié: (2024)

A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
par: Jiang, Xinwen, et autres
Publié: (2021)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
par: Chen, Yijia, et autres
Publié: (2023)

Binary Tree Block Encoding of Classical Matrix
par: Li, Zexian, et autres
Publié: (2025)

Building a Nest by an Automaton
par: Czyzowicz, Jurek, et autres
Publié: (2019)

A $5$-Approximation Analysis for the Cover Small Cuts Problem
par: Simmons, Miles, et autres
Publié: (2026)

Mim-Width is paraNP-complete
par: Bergougnoux, Benjamin, et autres
Publié: (2025)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
par: Antoniadis, Antonios, et autres
Publié: (2020)

Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
par: Fioravantes, Foivos, et autres
Publié: (2025)

Efficient Algorithms for Injectivity and Bounded Surjectivity of One-dimensional Nonlinear Cellular Automata
par: Wang, Chen, et autres
Publié: (2023)

Improved Computational Lower Bound of Estimation for Multi-Frequency Group Synchronization
par: Li, Zhangsong
Publié: (2026)

Advancing Stochastic 3-SAT Solvers by Dissipating Oversatisfied Constraints
par: Schwardt, J., et autres
Publié: (2025)

A faster heuristic for the Traveling Salesman Problem with Drone
par: Hokama, Pedro H. D. B., et autres
Publié: (2024)

A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space
par: Bergougnoux, Benjamin, et autres
Publié: (2025)

Spectral Shadows: When Communication Complexity Meets Linear Invariance Testing
par: Datta, Swarnalipa, et autres
Publié: (2026)

Balancing the Spread of Two Opinions in Sparse Social Networks
par: Knop, Dušan, et autres
Publié: (2021)

Quantum Speedup for Some Geometric 3SUM-Hard Problems and Beyond
par: Keil, J. Mark, et autres
Publié: (2024)

Approximating Traveling Salesman Problems Using a Bridge Lemma
par: Böhm, Martin, et autres
Publié: (2024)

Prediction-Augmented Mechanism Design for Weighted Facility Location
par: Shi, Yangguang, et autres
Publié: (2025)