Approximation algorithms for the TSP with sharpened triangle inequality (Q294819): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q126550381, #quickstatements; #temporary_batch_1722442319438
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Juraj Hromkovič / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / 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: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster scaling algorithms for general graph matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on proof verification and approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem with Distances One and Two / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025698306 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126550381 / rank
 
Normal rank

Latest revision as of 18:13, 31 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for the TSP with sharpened triangle inequality
scientific article

    Statements

    Approximation algorithms for the TSP with sharpened triangle inequality (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 June 2016
    0 references
    approximation algorithms
    0 references
    combinatorial problems
    0 references
    traveling salesman problem
    0 references

    Identifiers

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