Approximation algorithms for metric tree cover and generalized tour and tree covers (Q3004205): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximating the tree and tour covers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable networks, linear programming relaxations and the parsimonious property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximations for tour and tree covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing the Held-Karp TSP bound: A monotonicity property with application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic analysis, linear programming and branch and bound / rank
 
Normal rank

Latest revision as of 03:28, 4 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for metric tree cover and generalized tour and tree covers
scientific article

    Statements

    Approximation algorithms for metric tree cover and generalized tour and tree covers (English)
    0 references
    0 references
    0 references
    1 June 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    graph algorithms
    0 references
    network design
    0 references
    0 references