35/44-approximation for asymmetric maximum TSP with triangle inequality (Q627544): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An -approximation algorithm for the asymmetric maximum TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better approximations for max TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(\frac78\)-approximation algorithm for metric Max TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411276 / rank
 
Normal rank

Latest revision as of 20:27, 3 July 2024

scientific article
Language Label Description Also known as
English
35/44-approximation for asymmetric maximum TSP with triangle inequality
scientific article

    Statements

    35/44-approximation for asymmetric maximum TSP with triangle inequality (English)
    0 references
    0 references
    0 references
    0 references
    2 March 2011
    0 references
    traveling salesman problem
    0 references
    asymmetric maximum TSP
    0 references
    ATSP
    0 references
    approximation algorithm
    0 references

    Identifiers