scientific article; zbMATH DE number 1091558

DOI10.1002/(SICI)1097-0037(199703)29:2%3C107::AID-NET4%3E3.0.CO;2-NMaRDI QIDQ4367277zbMATH OpenFDO

Authors Akiyoshi Shioura, Maiko Shigeno

Publication date 25 November 1997

zbMATH Keywords

linear-time algorithmssubtreebottleneck knapsack problemstree center

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
• Center location problems on tree graphs with subtree-shaped customers
• The location of central structures in trees
• An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
• An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees

Cited in

(13)

• Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
• The centdian subtree on tree networks
• Efficient algorithms for the minmax regret path center problem with length constraint on trees
• Locating tree-shaped facilities using the ordered median objective
• The continuous and discrete path‐variance problems on trees
• Extensive facility location problems on networks: an updated review
• scientific article; zbMATH DE number 3848941 (Why is no real title available?)
• The nestedness property of the convex ordered median location problem on a tree
• Extensive facility location problems on networks with equity measures
• Tree knapsack approaches for local access network design
• Range minimization problems in path-facility location on trees
• The extensive 1-median problem with radius on networks
• Optimal algorithms for the path/tree-shaped facility location problems in trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367277)