On fixed-parameter solvability of the minimax path location problem
From MaRDI portal
Publication:6063573
Recommendations
Cites work
- A linear algorithm for a core of a tree
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Combinatorial optimization. Theory and algorithms.
- Conditional location of path and tree shaped facilities on trees
- Geometric complexity of some location problems
- Graph theory
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Improved algorithms for some competitive location centroid problems on paths, trees and graphs
- On locating path- or tree-shaped facilities on networks
- On the complexity of locating linear facilities in the plane
- Optimal algorithms for the path/tree-shaped facility location problems in trees
- Optimal location of a path or tree on a network with cycles
- Reliability problems in multiple path-shaped facility location on networks
- The location of median paths on grid graphs
- The optimal location of a path or tree in a tree network
- Two paths location of a tree with positive or negative weights
Cited in
(2)
This page was built for publication: On fixed-parameter solvability of the minimax path location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063573)