Enclosing \(k\) points in the smallest axis parallel rectangle (Q293194): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding k points with minimum diameter and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some geometric selection and optimization problems via sorted matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static and dynamic algorithms for k-point clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated nearest neighbors and finding minimal polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Selection and Ranking: Sorted Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On geometric optimization with few violated constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: L-infinity interdistance selection by parametric search / rank
 
Normal rank

Latest revision as of 02:37, 12 July 2024

scientific article
Language Label Description Also known as
English
Enclosing \(k\) points in the smallest axis parallel rectangle
scientific article

    Statements

    Identifiers