Efficiently approximating color-spanning balls (Q284593): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4796181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for approximate nearest neighbor searching fixed dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster core-set constructions and data stream algorithms in fixed dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rectangularp-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Selection and Ranking: Sorted Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The upper envelope of Voronoi surfaces and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest color-spanning intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Smallest Color-Spanning Axis-Parallel Square / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple randomized sieve algorithm for the closest-pair problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On enclosing k points by a circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A near-linear algorithm for the planar 2-center problem / rank
 
Normal rank

Latest revision as of 00:47, 12 July 2024

scientific article
Language Label Description Also known as
English
Efficiently approximating color-spanning balls
scientific article

    Statements

    Efficiently approximating color-spanning balls (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 May 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    color-spanning objects
    0 references
    complexity
    0 references
    0 references