Many Visits TSP Revisited

DOI10.4230/LIPICS.ESA.2020.66MaRDI QIDQ5874538zbMATH OpenOpenAlexFDO

Authors Łukasz Kowalik, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström, Shao-Hua Li

Publication date 7 February 2023

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2020/12932/pdf/LIPIcs-ESA-2020-66.pdf/

zbMATH Keywords

exponential algorithmmany visits traveling salesman problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 3698383 (Why is no real title available?)
• A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Algorithmic meta-theorems for restrictions of treewidth
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Low-complexity algorithms for sequencing jobs with a fixed number of job-classes
• Maximum Scatter TSP in Doubling Metrics
• On the complexity of \(k\)-SAT
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
• The Factorization of Linear Graphs
• Which problems have strongly exponential complexity?

This page was built for publication: Many Visits TSP Revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874538)