Improved algorithms to network p-center location problems
From MaRDI portal
Publication:390143
Recommendations
- The \(p\)-center problem in tree networks revisited
- An improved algorithm for the distance constrainedp-center location problem with mutual communication on tree networks
- An improved algorithm for the p-center problem on interval graphs with unit lengths
- Some new algorithms for location problems on networks
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
Cited in
(12)- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
- \(k\)-center of network location problem based on improved algorithm
- An improved algorithm for the p-center problem on interval graphs with unit lengths
- scientific article; zbMATH DE number 4020808 (Why is no real title available?)
- The two-center problem of uncertain points on trees
- Double bound method for solving the p-center location problem
- Enhancements to two exact algorithms for solving the vertex P-center problem
- The \(p\)-center problem in tree networks revisited
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
- The weighted \(k\)-center problem in trees for fixed \(k\)
- Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs
- An improved algorithm for the distance constrainedp-center location problem with mutual communication on tree networks
This page was built for publication: Improved algorithms to network \(p\)-center location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390143)