New approximation algorithms for the rooted budgeted cycle cover problem (Q5918725): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRP / 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.1007/978-3-030-92681-6_14 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4205805254 / 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: Approximation algorithms for deadline-TSP and vehicle routing with time-windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Orienteering and Discounted-Reward TSP / 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: Min-max tree covers of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem. Latest advances and new challenges. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of the minimum-weight \(k\)-size cycle cover problem / 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: To fill or not to fill / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink / 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: The Vehicle Routing Problem / 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 a min-max location-routing problem / 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: Improved approximation algorithms for some min-max and minimum cycle cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximation algorithms for the minimum cycle cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation to the Minimum Rooted Star Cover Problem / rank
 
Normal rank

Latest revision as of 12:45, 29 July 2024

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

    Statements

    New approximation algorithms for the rooted budgeted cycle cover problem (English)
    0 references
    0 references
    0 references
    29 June 2022
    0 references
    0 references
    budgeted cycle cover
    0 references
    wireless sensor network
    0 references
    graph algorithm
    0 references
    approximation algorithm
    0 references
    combinatorial optimization
    0 references
    0 references