Approximating the \(k\)-traveling repairman problem with repair times (Q2457300): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4471278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Delivery Man Problem and Cumulative Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving an epsilon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The delivery man problem on a tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737530 / rank
 
Normal rank

Latest revision as of 11:10, 27 June 2024

scientific article
Language Label Description Also known as
English
Approximating the \(k\)-traveling repairman problem with repair times
scientific article

    Statements

    Approximating the \(k\)-traveling repairman problem with repair times (English)
    0 references
    0 references
    0 references
    30 October 2007
    0 references
    approximation algorithms
    0 references
    combinatorial optimization
    0 references

    Identifiers

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