FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704)

From MaRDI portal
Revision as of 01:58, 3 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article; zbMATH DE number 7746234
Language Label Description Also known as
English
FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM
scientific article; zbMATH DE number 7746234

    Statements

    FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (English)
    0 references
    0 references
    0 references
    0 references
    5 October 2023
    0 references
    prize-collecting traveling salesman problem
    0 references
    triangle inequality
    0 references
    approximation algorithm
    0 references
    fixed approximation ratio
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers