The inverse center subtree problem on tree graphs
From MaRDI portal
Cites work
- An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
- Extensive facility location problems on networks: an updated review
- Finding the upper envelope of n line segments in O(n log n) time
- scientific article; zbMATH DE number 949659 (Why is no real title available?)
- Inverse 1-center location problems with edge length augmentation on trees
- Inverse 1-median problem on block graphs with variable vertex weights
- Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
- Inverse 1-median problem on trees under weighted Hamming distance
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse median problems
- Inverse Optimization
- Inverse quickest center location problem on a tree
- Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm
- Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
- On an instance of the inverse shortest paths problem
- On some inverse 1-center location problems
- The complexity analysis of the inverse center location problem
- The inverse 1-center problem on cycles with variable edge lengths
- The inverse 1-median problem on a cycle
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
This page was built for publication: The inverse center subtree problem on tree graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6840213)
