Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
From MaRDI portal
Publication:1270784
Recommendations
Cites work
- `` Strong NP-Completeness Results
- An Algorithm for Large Zero-One Knapsack Problems
- Approximation algorithms for the capacitated plant allocation problem
- Combinatorial Problems: Reductibility and Approximation
- Fast Approximation Algorithms for Knapsack Problems
- scientific article; zbMATH DE number 3644795 (Why is no real title available?)
- scientific article; zbMATH DE number 4051357 (Why is no real title available?)
- Maximal Direct Covering Tree Problems
- Obnoxious Facility Location on Graphs
- On a tree-shaped facility location problem of Minieka
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- On locating path- or tree-shaped facilities on networks
- The optimal location of a path or tree in a tree network
Cited in
(17)- Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
- Extensive facility location problems on networks with equity measures
- The centdian subtree on tree networks
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- Extensive facility location problems on networks: an updated review
- Revisiting k-sum optimization
- Locating tree-shaped facilities using the ordered median objective
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
- Improved algorithms for single machine scheduling with release dates and rejections
- scientific article; zbMATH DE number 1091558 (Why is no real title available?)
- scientific article; zbMATH DE number 2119651 (Why is no real title available?)
- The continuous and discrete path‐variance problems on trees
- Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC
- Linear pseudo-polynomial factor algorithm for automaton constrained tree knapsack problem
- Minimizing the maximum lateness for scheduling with release times and job rejection
- Range minimization problems in path-facility location on trees
- Finding the conditional location of a median path on a tree
This page was built for publication: Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1270784)
