Covering points by disjoint boxes with outliers (Q617548): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finding k points with minimum diameter and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a Point Set by Two Disjoint Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for optimal outlier removal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a set of points by two axis-parallel boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric applications of a randomized optimization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Dimensional Linear Programming with Violations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation / 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: Discrete rectilinear 2-center problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / 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: On the Complexity of Some Common Geometric Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a set of points in a plane using two parallel rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enclosing \(k\) points in the smallest axis parallel rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial bound for linear programming and related problems / rank
 
Normal rank

Latest revision as of 17:14, 3 July 2024

scientific article
Language Label Description Also known as
English
Covering points by disjoint boxes with outliers
scientific article

    Statements

    Covering points by disjoint boxes with outliers (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 January 2011
    0 references
    NP-hard
    0 references
    optimization
    0 references
    outliers
    0 references
    rectangle covering
    0 references
    square covering
    0 references
    rectilinear \(p\)-center problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references