The bound coverage problem by aligned disks in \(L_1\) metric (Q6113856): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3601572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-min dispersion on a line / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for base station coverage with minimum total radii / 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: The Prize-collecting Call Control Problem on Weighted Lines and Rings / 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: The coverage problem by aligned disks / 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: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bottleneck semi-matching / rank
 
Normal rank

Latest revision as of 12:58, 2 August 2024

scientific article; zbMATH DE number 7724754
Language Label Description Also known as
English
The bound coverage problem by aligned disks in \(L_1\) metric
scientific article; zbMATH DE number 7724754

    Statements

    The bound coverage problem by aligned disks in \(L_1\) metric (English)
    0 references
    0 references
    0 references
    10 August 2023
    0 references
    disk coverage problem
    0 references
    bound
    0 references
    fully polynomial time approximation scheme
    0 references

    Identifiers