Computing the center of uncertain points on tree networks

DOI10.1007/S00453-016-0158-3MaRDI QIDQ527423zbMATH OpenOpenAlexFDO

Authors Haitao Wang, Jingru Zhang

Publication date 11 May 2017

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-016-0158-3

zbMATH Keywords

algorithmsdata structuresfacility locationone-centertree networkuncertain data

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Computing the center of uncertain points on tree networks
• A note on computing the center of uncertain data on the real line
• Computing the rectilinear center of uncertain points in the plane
• One-dimensional \(k\)-center on uncertain data

Cites work

• A 1-center problem on the plane with uniformly distributed demand points
• An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem
• Closest pair and the post office problem for stochastic points
• Facility location problems with uncertainty on the plane
• Fast Algorithms for Finding Nearest Common Ancestors
• Geometric Computations on Indecisive Points
• scientific article; zbMATH DE number 177557 (Why is no real title available?)
• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• Kinetic 2-centers in the black-box model
• Largest bounding box, smallest diameter, and related problems on imprecise points
• Line-constrained k-median, k-means, and k-center problems in the plane
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• Minimax regret p-center location on a network with demand uncertainty
• Minmax regret 1-facility location on uncertain path networks
• Nearest-neighbor searching under uncertainty. I
• New Results on the Complexity of p-Centre Problems
• On the Complexity of Some Common Geometric Location Problems
• On the Most Likely Convex Hull of Uncertain Points
• On the most likely Voronoi diagram and nearest neighbor searching
• One-dimensional \(k\)-center on uncertain data
• Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p
• Slowing down sorting networks to obtain faster sorting algorithms
• Some variations on constrained minimum enclosing circle problem
• Stochastic minimum spanning trees in Euclidean spaces
• THE ALIGNED K-CENTER PROBLEM

Cited in

(11)

• A note on computing the center of uncertain data on the real line
• The two-center problem of uncertain points on a real line
• The \(p\)-center problem under locational uncertainty of demand points
• One-dimensional \(k\)-center on uncertain data
• Computing the center of uncertain points on tree networks
• Computing the rectilinear center of uncertain points in the plane
• One-dimensional \(k\)-center on uncertain data
• Computing the center of uncertain points on cactus graphs
• The two-center problem of uncertain points on trees
• Computing the center of uncertain points on cactus graphs
• The connected k-vertex one-center problem on graphs

This page was built for publication: Computing the center of uncertain points on tree networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q527423)