An extension of Christofides heuristic to the k-person travelling salesman problem (Q1838426): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Alan M. Frieze / rank
Normal rank
 
Property / author
 
Property / author: Alan M. Frieze / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for christofides' traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Some Postman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4191856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank

Latest revision as of 18:30, 13 June 2024

scientific article
Language Label Description Also known as
English
An extension of Christofides heuristic to the k-person travelling salesman problem
scientific article

    Statements

    An extension of Christofides heuristic to the k-person travelling salesman problem (English)
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    k-person travelling salesman
    0 references
    Christofides heuristic
    0 references
    minimum length k- person tour
    0 references
    complete graph
    0 references
    upper bound
    0 references
    approximation algorithm
    0 references
    0 references
    0 references