The connected p-center problem on cactus graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 177557 (Why is no real title available?)
- scientific article; zbMATH DE number 5205606 (Why is no real title available?)
- A simple linear-time algorithm for computing the center of an interval graph
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Efficient algorithms for centers and medians in interval and circular-arc graphs
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
- Structured \(p\)-facility location problems on the line solvable in polynomial time
- The connected p-center problem on block graphs with forbidden vertices
Cited in
(15)- The inverse connected p-median problem on block graphs under various cost functions
- The connected \(p\)-median problem on complete multi-layered graphs
- A simple greedy approximation algorithm for the minimum connected k-center problem
- The complete vertex \(p\)-center problem
- The connected \(p\)-center problem on cactus graphs
- scientific article; zbMATH DE number 4173027 (Why is no real title available?)
- Approximability results for the converse connected \(p\)-centre problem
- The 2-maxian problem on cactus graphs
- Computing the center of uncertain points on cactus graphs
- scientific article; zbMATH DE number 5205606 (Why is no real title available?)
- The obnoxious center problem on weighted cactus graphs.
- The connected p-center problem on block graphs with forbidden vertices
- Efficient algorithms for center problems in cactus networks
- A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint
- A linear time algorithm for connected \(p\)-centdian problem on block graphs
This page was built for publication: The connected \(p\)-center problem on cactus graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1630992)