Fast stabbing of boxes in high dimensions (Q1583093): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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: Label placement by maximum independent set in rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved non-approximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal set covers in finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection properties of boxes in \(R^ n\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the vertex cover number of a hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic data structures for fat objects and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering boxes by points / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3263885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / 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: Fast approximation algorithms for a nonconvex covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The slab dividing approach to solve the Euclidean \(P\)-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On point covers of parallel rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ultimate Planar Convex Hull Algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations and optimal geometric divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On point covers of \(c-\)oriented polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Upper Bounds in Klee’s Measure Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228498 / rank
 
Normal rank

Latest revision as of 15:52, 30 May 2024

scientific article
Language Label Description Also known as
English
Fast stabbing of boxes in high dimensions
scientific article

    Statements

    Fast stabbing of boxes in high dimensions (English)
    0 references
    26 October 2000
    0 references
    computational geometry
    0 references
    geometric combinatorial optimization
    0 references
    output-sensitive algorithms
    0 references
    0 references

    Identifiers