Computing the center of uncertain points on tree networks
type: Item
instance of: scholarly article
title: Computing the center of uncertain points on tree networks
zbMATH Open document ID: 1360.68793
author: Haitao Wang
author: Jingru Zhang
published in: Algorithmica
publication date: 2017-05-11T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6714290
zbMATH Keywords: facility location
zbMATH Keywords: one-center
zbMATH Keywords: uncertain data
zbMATH Keywords: tree network
zbMATH Keywords: algorithms
zbMATH Keywords: data structures
MaRDI profile type: Publication
full work available at URL: s00453-016-0158-3
OpenAlex ID: W2345659331
cites work: Minimax regret p-center location on a network with demand uncertainty
cites work: Nearest-neighbor searching under uncertainty. I
cites work: Convex hulls under uncertainty
cites work: Facility location problems with uncertainty on the plane
cites work: Q4508365
cites work: Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p
cites work: THE ALIGNED K-CENTER PROBLEM
cites work: Slowing down sorting networks to obtain faster sorting algorithms
cites work: Kinetic 2-centers in the black-box model
cites work: A 1-center problem on the plane with uniformly distributed demand points
cites work: Q4037428
cites work: Fast Algorithms for Finding Nearest Common Ancestors
cites work: Geometric Computations on Indecisive Points
cites work: Closest Pair and the Post Office Problem for Stochastic Points
cites work: Stochastic minimum spanning trees in euclidean spaces
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Some variations on constrained minimum enclosing circle problem
cites work: Largest bounding box, smallest diameter, and related problems on imprecise points
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: On the Complexity of Some Common Geometric Location Problems
cites work: New Results on the Complexity of p-Centre Problems
cites work: An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
cites work: An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem
cites work: On the Most Likely Voronoi Diagramand Nearest Neighbor Searching
cites work: On the Most Likely Convex Hull of Uncertain Points
cites work: Minmax regret 1-facility location on uncertain path networks
cites work: Line-Constrained $$k$$ -Median, $$k$$ -Means, and $$k$$ -Center Problems in the Plane
cites work: One-Dimensional k-Center on Uncertain Data
DOI: 10.1007/S00453-016-0158-3
description: scientific article; zbMATH DE number 6714290