Many Visits TSP Revisited

DOI10.4230/LIPICS.ESA.2020.66OpenAlexW3082860873MaRDI QIDQ5874538FDOQ5874538

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

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

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)