An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q6149344): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Complexity of Numerical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on multicovering with disks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-factor approximation for multi-covering with disks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the minimum power partial cover problem on the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to approximating partial covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual algorithm for the minimum power partial cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum power partial multi-cover on a line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the minimum power cover problem with submodular/linear penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual algorithm for the minimum partial set multi-cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local ratio method on partial set multi-cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem / rank
 
Normal rank

Latest revision as of 11:51, 26 August 2024

scientific article; zbMATH DE number 7799982
Language Label Description Also known as
English
An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
scientific article; zbMATH DE number 7799982

    Statements

    An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 February 2024
    0 references
    primal-dual
    0 references
    power cover
    0 references
    penalty cost
    0 references
    approximation algorithm
    0 references

    Identifiers