Traveling salesman problems in temporal graphs (Q284573): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2016.04.006 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2016.04.006 / rank
 
Normal rank

Latest revision as of 13:16, 9 December 2024

scientific article
Language Label Description Also known as
English
Traveling salesman problems in temporal graphs
scientific article

    Statements

    Traveling salesman problems in temporal graphs (English)
    0 references
    0 references
    0 references
    18 May 2016
    0 references
    dynamic network
    0 references
    exploration
    0 references
    TSP with costs one and two
    0 references
    temporal matching
    0 references
    approximation algorithm
    0 references
    hardness result
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references