On the relationship between ATSP and the cycle cover problem (Q868952): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance guarantees for the TSP with a parameterized triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the TSP with sharpened triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On patching algorithms for random asymmetric travelling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank

Revision as of 14:15, 25 June 2024

scientific article
Language Label Description Also known as
English
On the relationship between ATSP and the cycle cover problem
scientific article

    Statements

    On the relationship between ATSP and the cycle cover problem (English)
    0 references
    0 references
    0 references
    26 February 2007
    0 references
    assignment problem
    0 references
    cycle cover
    0 references
    traveling salesman problem
    0 references
    combinatorial optimization
    0 references
    approximation algorithms
    0 references

    Identifiers

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