On fixed-parameter solvability of the minimax path location problem

DOI10.1007/s42967-022-00238-6MaRDI QIDQ6063573

Hao Lin, Cheng He

Publication date: 12 December 2023

Published in: Communications on Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

polynomial-time algorithmdiscrete locationgraph characterizationpath locationfixed-parameter solvability

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two paths location of a tree with positive or negative weights
• Optimal algorithms for the path/tree-shaped facility location problems in trees
• Geometric complexity of some location problems
• On the complexity of locating linear facilities in the plane
• Reliability problems in multiple path-shaped facility location on networks
• Improved algorithms for some competitive location centroid problems on paths, trees and graphs
• The location of median paths on grid graphs
• On locating path- or tree-shaped facilities on networks
• Optimal location of a path or tree on a network with cycles
• The optimal location of a path or tree in a tree network
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• A linear algorithm for a core of a tree
• Conditional location of path and tree shaped facilities on trees
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: On fixed-parameter solvability of the minimax path location problem