A linear-time algorithm for the center problem in weighted cycle graphs
From MaRDI portal
Publication:6551721
DOI10.1016/j.ipl.2024.106495zbMATH Open1541.05172MaRDI QIDQ6551721
Publication date: 7 June 2024
Published in: Information Processing Letters (Search for Journal in Brave)
Paths and cycles (05C38) Operations research and management science (90B99) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)
Cites Work
- A \(p\)-center grid-positioning aggregation procedure
- A linear-time algorithm for solving the center problem on weighted cactus graphs
- Efficient algorithms for center problems in cactus networks
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Off-Line Maintenance of Planar Configurations
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees
- Unnamed Item
- Unnamed Item
This page was built for publication: A linear-time algorithm for the center problem in weighted cycle graphs