New approximation algorithms for the minimum cycle cover problem (Q5919633): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127826236, #quickstatements; #temporary_batch_1721943449312
 
(4 intermediate revisions by 4 users not shown)
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.2019.04.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2793661806 / 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: 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: Q4198056 / 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: Minimum Vehicle Routing with a Common Deadline / 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 / cites work
 
Property / cites work: Improved approximation algorithms for some min-max and minimum cycle cover problems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127826236 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:59, 25 July 2024

scientific article; zbMATH DE number 7114328
Language Label Description Also known as
English
New approximation algorithms for the minimum cycle cover problem
scientific article; zbMATH DE number 7114328

    Statements

    New approximation algorithms for the minimum cycle cover problem (English)
    0 references
    0 references
    0 references
    0 references
    7 October 2019
    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
    0 references