The two-center problem of uncertain points on trees

DOI10.1007/978-3-031-49611-0_35MaRDI QIDQ6606211

Jing-Ru Zhang, Haitao Xu

Publication date: 16 September 2024

zbMATH Keywords

algorithmstreestwo-centeruncertain points

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Improved algorithms to network \(p\)-center location problems
• Computing the center of uncertain points on tree networks
• On the planar two-center problem and circular hulls
• Efficient algorithms for center problems in cactus networks
• A note on searching line arrangements and applications
• The two-center problem of uncertain points on a real line
• An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Stochastic k-Center and j-Flat-Center Problems
• Covering uncertain points in a tree
• Computing the center of uncertain points on cactus graphs

This page was built for publication: The two-center problem of uncertain points on trees