Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio (Q2839206): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q551177
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alexander Tiskin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2009.02.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1613650767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Metric TSP in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Travelling Salesman and the PQ-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for christofides' traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good triangulations yield good tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidean traveling salesman problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two geometric problems related to the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931037 / rank
 
Normal rank

Latest revision as of 15:15, 6 July 2024

scientific article
Language Label Description Also known as
English
Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
scientific article

    Statements

    Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio (English)
    0 references
    0 references
    0 references
    4 July 2013
    0 references
    0 references
    approximation algorithms
    0 references
    metric TSP
    0 references
    double-tree shortcutting
    0 references
    0 references