Covering uncertain points in a tree
From MaRDI portal
Publication:5920112
DOI10.1007/978-3-319-62127-2_47zbMath1421.68030arXiv1704.07497OpenAlexW2964179137MaRDI QIDQ5920112
Publication date: 22 September 2017
Published in: Algorithmica, Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.07497
Related Items
Computing \(k\)-centers of uncertain points on a real line, The \(p\)-center problem under locational uncertainty of demand points, Computing the center of uncertain points on cactus graphs, An O(n log n)-Time Algorithm for the k-Center Problem in Trees, An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees
Cites Work
- Unnamed Item
- Unnamed Item
- Minmax regret 1-facility location on uncertain path networks
- One-dimensional \(k\)-center on uncertain data
- Computing the center of uncertain points on tree networks
- The level ancestor problem simplified
- Fractional cascading. I: A data structuring technique
- Covering a set of points in multidimensional space
- Optimizing squares covering a set of points
- Facility location problems with uncertainty on the plane
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Geometric red-blue set cover for unit squares and related problems
- Convex hulls under uncertainty
- Nearest-neighbor searching under uncertainty. I
- On the Most Likely Convex Hull of Uncertain Points
- On the Most Likely Voronoi Diagramand Nearest Neighbor Searching
- COVERING A POINT SET BY TWO DISJOINT RECTANGLES
- Fast Algorithms for Finding Nearest Common Ancestors
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- New Results on the Complexity of p-Centre Problems
- Approximation schemes for covering and packing problems in image processing and VLSI
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- Minimax regret p-center location on a network with demand uncertainty
- Stochastic k-Center and j-Flat-Center Problems
- Slowing down sorting networks to obtain faster sorting algorithms
- Finding kth paths and p-centers by generating and searching good data structures
- An O(n log n)-Time Algorithm for the k-Center Problem in Trees
- Kinetic 2-centers in the black-box model
- Geometric Computations on Indecisive Points
- Closest Pair and the Post Office Problem for Stochastic Points
- PTAS for geometric hitting set problems via local search
- Stochastic minimum spanning trees in euclidean spaces
