Computing the center of uncertain points on cactus graphs

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

Authors: Ran Hu, Divy H. Kanani, Jingru Zhang 

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

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

Cited In (1)

• The two-center problem of uncertain points on trees

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

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