scientific article; zbMATH DE number 7529154

DOI10.20382/JOCG.V12I2A3MaRDI QIDQ5077643zbMATH OpenFDO

Authors Sándor Kisfaludi-Bak

Publication date 18 May 2022

Full work available at URL https://arxiv.org/abs/2002.05414

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Elementary problems in hyperbolic and elliptic geometries (51M09)

Recommendations

• A quasi-polynomial algorithm for well-spaced hyperbolic TSP
• Approximation Polynomial Algorithms for Some Modifications of TSP
• Applications of a special polynomial class of TSP
• Applications of a special polynomial class of TSP
• Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
• An approximation algorithm for the TSP
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP
• An improved approximation algorithm for TSP in the half integral case
• scientific article; zbMATH DE number 1303538

Cited in

(2)

• A hybrid exact algorithm for the TSPTW
• A quasi-polynomial algorithm for well-spaced hyperbolic TSP

This page was built for publication:

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