A note on approximation algorithms of the clustered traveling salesman problem (Q2398506): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An improved approximation algorithm for the clustered traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Some Postman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Christofides' heuristic: some paths are more difficult than cycles / rank
 
Normal rank

Revision as of 06:12, 14 July 2024

scientific article
Language Label Description Also known as
English
A note on approximation algorithms of the clustered traveling salesman problem
scientific article

    Statements

    A note on approximation algorithms of the clustered traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 August 2017
    0 references
    traveling salesman problem
    0 references
    clustered traveling salesman problem
    0 references
    approximation algorithms
    0 references

    Identifiers