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

← Older edit

@@ description / en / description / en @@
+scientific article; zbMATH DE number 7056533
@@ Property / zbMATH Open document ID @@
+.68031
@@ Property / zbMATH Open document ID: 1421.68031 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/s00453-018-00537-6
@@ Property / DOI: 10.1007/s00453-018-00537-6 / rank @@
+Normal rank
@@ Property / published in @@
+Algorithmica
@@ Property / published in: Algorithmica / rank @@
+Normal rank
@@ Property / publication date @@
+May 2019Timestamp +2019-05-17T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2019-05-17T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 17 May 2019 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+7056533
@@ Property / zbMATH DE Number: 7056533 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2926686156
@@ Property / OpenAlex ID: W2926686156 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+uncertain points
@@ Property / zbMATH Keywords: uncertain points / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+coverage
@@ Property / zbMATH Keywords: coverage / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+k-center
@@ Property / zbMATH Keywords: k-center / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+trees
@@ Property / zbMATH Keywords: trees / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+algorithms
@@ Property / zbMATH Keywords: algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+data structures
@@ Property / zbMATH Keywords: data structures / rank @@
+Normal rank
@@ Property / cites work @@
+Nearest-neighbor searching under uncertainty. I
@@ Property / cites work: Nearest-neighbor searching under uncertainty. I / rank @@
+Normal rank
@@ Property / cites work @@
+Convex hulls under uncertainty
@@ Property / cites work: Convex hulls under uncertainty / rank @@
+Normal rank
@@ Property / cites work @@
+Facility location problems with uncertainty on the plane
+Normal rank
@@ Property / cites work @@
+Minimax regret p-center location on a network with demand uncertainty
+Normal rank
@@ Property / cites work @@
+Q4508365
@@ Property / cites work: Q4508365 / rank @@
+Normal rank
@@ Property / cites work @@
+The level ancestor problem simplified
@@ Property / cites work: The level ancestor problem simplified / rank @@
+Normal rank
@@ Property / cites work @@
+Optimizing squares covering a set of points
@@ Property / cites work: Optimizing squares covering a set of points / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric red-blue set cover for unit squares and related problems
+Normal rank
@@ Property / cites work @@
+Fractional cascading. I: A data structuring technique
+Normal rank
@@ Property / cites work @@
+Slowing down sorting networks to obtain faster sorting algorithms
+Normal rank
@@ Property / cites work @@
+Kinetic 2-centers in the black-box model
@@ Property / cites work: Kinetic 2-centers in the black-box model / rank @@
+Normal rank
@@ Property / cites work @@
+Q4037428
@@ Property / cites work: Q4037428 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding kth paths and p-centers by generating and searching good data structures
+Normal rank
@@ Property / cites work @@
+Covering a set of points in multidimensional space
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Approximation schemes for covering and packing problems in image processing and VLSI
+Normal rank
@@ Property / cites work @@
+Stochastic <i>k</i>-Center and <i>j</i>-Flat-Center Problems
+Normal rank
@@ Property / cites work @@
+Geometric Computations on Indecisive Points
@@ Property / cites work: Geometric Computations on Indecisive Points / rank @@
+Normal rank
@@ Property / cites work @@
+Closest Pair and the Post Office Problem for Stochastic Points
+Normal rank
@@ Property / cites work @@
+Stochastic minimum spanning trees in euclidean spaces
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians
+Normal rank
@@ Property / cites work @@
+COVERING A POINT SET BY TWO DISJOINT RECTANGLES
@@ Property / cites work: COVERING A POINT SET BY TWO DISJOINT RECTANGLES / rank @@
+Normal rank
@@ Property / cites work @@
+Largest bounding box, smallest diameter, and related problems on imprecise points
+Normal rank
@@ Property / cites work @@
+Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
+Normal rank
@@ Property / cites work @@
+New Results on the Complexity of <i>p</i>-Centre Problems
+Normal rank
@@ 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
+Normal rank
@@ Property / cites work @@
+PTAS for geometric hitting set problems via local search
+Normal rank
@@ Property / cites work @@
+On the Most Likely Voronoi Diagramand Nearest Neighbor Searching
+Normal rank
@@ Property / cites work @@
+On the Most Likely Convex Hull of Uncertain Points
+Normal rank
@@ Property / cites work @@
+Minmax regret 1-facility location on uncertain path networks
+Normal rank
@@ Property / cites work @@
+One-dimensional \(k\)-center on uncertain data
@@ Property / cites work: One-dimensional \(k\)-center on uncertain data / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the center of uncertain points on tree networks
+Normal rank
@@ Property / cites work @@
+An O(n log n)-Time Algorithm for the k-Center Problem in Trees
+Normal rank
@@ Property / Wikidata QID @@
+Q128546565
@@ Property / Wikidata QID: Q128546565 / rank @@
+Normal rank