Computing the center of uncertain points on cactus graphs

DOI10.1007/978-3-031-34347-6_20OpenAlexW4379134847MaRDI QIDQ6182908

Divy H. Kanani, Jing-Ru Zhang, Ran Hu

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-34347-6_20

zbMATH Keywords

algorithmscactus graphone-centeruncertain points

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• The connected \(p\)-center problem on block graphs with forbidden vertices
• Computing the center of uncertain points on tree networks
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• The obnoxious center problem on weighted cactus graphs.
• A linear-time algorithm for solving the center problem on weighted cactus graphs
• The connected \(p\)-center problem on cactus graphs
• Facility location problems with uncertainty on the plane
• A note on computing the center of uncertain data on the real line
• Dynamic half-space range reporting and its applications
• Preclustering algorithms for imprecise points
• Efficient algorithms for center problems in cactus networks
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Minimax regret p-center location on a network with demand uncertainty
• Stochastic k-Center and j-Flat-Center Problems
• Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model
• Covering uncertain points in a tree

This page was built for publication: Computing the center of uncertain points on cactus graphs