Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2016.01.041 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.041 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2258629489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for minimum and min-max vehicle routing problems / 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: Approximation Algorithms for the Multi-Vehicle Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max tree covers of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max cover of a graph with a small number of parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax Tree Cover in the Euclidean Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minmax rooted-tree cover in a tree / 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: Approximation Algorithms for Min-Max Cycle Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results for min-max path cover problems in vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results for a min-max location-routing problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2016.01.041 / rank
 
Normal rank

Latest revision as of 14:56, 9 December 2024

scientific article
Language Label Description Also known as
English
Improved approximation algorithms for some min-max and minimum cycle cover problems
scientific article

    Statements

    Improved approximation algorithms for some min-max and minimum cycle cover problems (English)
    0 references
    0 references
    0 references
    24 November 2016
    0 references
    vehicle routing
    0 references
    cycle cover
    0 references
    traveling salesman problem
    0 references
    approximation algorithm
    0 references

    Identifiers

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