An improved approximation algorithm for the most points covering problem (Q692901): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s00224-011-9353-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036721110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for geometric set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal packing and covering in the plane are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Application of Width Bounded Geometric Separator / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a set of points in multidimensional space / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for partial covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The budgeted maximum coverage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a circle placement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering many or few points with unit disks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank

Latest revision as of 23:50, 5 July 2024

scientific article
Language Label Description Also known as
English
An improved approximation algorithm for the most points covering problem
scientific article

    Statements

    An improved approximation algorithm for the most points covering problem (English)
    0 references
    6 December 2012
    0 references
    geometric covering
    0 references
    most points covering
    0 references
    partial covering
    0 references
    approximation algorithm
    0 references
    computational geometry
    0 references

    Identifiers