Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q101127888, #quickstatements; #temporary_batch_1712272666262
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2.5-factor approximation algorithm for the \(k\)-MST problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the on-line quota traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for orienteering and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connected Subgraph Problems in Wildlife Conservation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharing the cost of multicast transmissions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the traveling repairman and speeding deliveryman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving an epsilon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better approximation algorithm for the budget prize collecting tree problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for distance constrained vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank

Revision as of 10:54, 23 July 2024

scientific article; zbMATH DE number 7242695
Language Label Description Also known as
English
Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
scientific article; zbMATH DE number 7242695

    Statements

    Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 September 2020
    0 references
    approximation algorithms
    0 references
    traveling salesman problem
    0 references
    constrained optimization
    0 references

    Identifiers