Covering uncertain points in a tree (Q5920112): Difference between revisions

From MaRDI portal
Merged Item from Q5971165
Created claim: Wikidata QID (P12): Q128546565, #quickstatements; #temporary_batch_1727086280889
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Nearest-neighbor searching under uncertainty. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex hulls under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location problems with uncertainty on the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret p-center location on a network with demand uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The level ancestor problem simplified / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing squares covering a set of points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric red-blue set cover for unit squares and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional cascading. I: A data structuring technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kinetic 2-centers in the black-box model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding kth paths and p-centers by generating and searching good data structures / 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: Fast Algorithms for Finding Nearest Common Ancestors / 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: Stochastic <i>k</i>-Center and <i>j</i>-Flat-Center Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Computations on Indecisive Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closest Pair and the Post Office Problem for Stochastic Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic minimum spanning trees in euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / 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: Largest bounding box, smallest diameter, and related problems on imprecise points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on the Complexity of <i>p</i>-Centre Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: PTAS for geometric hitting set problems via local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Most Likely Voronoi Diagramand Nearest Neighbor Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Most Likely Convex Hull of Uncertain Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax regret 1-facility location on uncertain path networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional \(k\)-center on uncertain data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the center of uncertain points on tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n)-Time Algorithm for the k-Center Problem in Trees / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128546565 / rank
 
Normal rank

Latest revision as of 11:15, 23 September 2024

scientific article; zbMATH DE number 7056533
Language Label Description Also known as
English
Covering uncertain points in a tree
scientific article; zbMATH DE number 7056533

    Statements

    Covering uncertain points in a tree (English)
    0 references
    0 references
    0 references
    22 September 2017
    0 references
    17 May 2019
    0 references
    uncertain points
    0 references
    coverage
    0 references
    k-center
    0 references
    trees
    0 references
    algorithms
    0 references
    data structures
    0 references
    0 references
    0 references

    Identifiers

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