TSP with locational uncertainty: the adversarial model

DOI10.4230/LIPICS.SOCG.2017.32MaRDI QIDQ4580107zbMATH OpenFDO

Authors Gui Citovsky, Tyler Mayer, Joseph S. B. Mitchell

Publication date 13 August 2018

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

zbMATH Keywords

uncertaintyapproximation algorithmstraveling salesperson problemTSP with neighborhoods

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Approximation algorithms for TSP with neighborhoods in the plane
• Approximation algorithms for TSP with neighborhoods in the plane
• The online TSP against fair adversaries
• scientific article; zbMATH DE number 1629852
• Euclidean Traveling Salesman Tours through Stochastic Neighborhoods

Cited in

(1)

• Dispersing points on intervals

This page was built for publication: TSP with locational uncertainty: the adversarial model

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