Stability of approximation algorithms and the knapsack problem
From MaRDI portal
Recommendations
- A Stability Concept For Zero-One Knapsack Problems And Approximation Algorithms
- Stability of approximation algorithms for hard optimization problems
- Constant-time approximation algorithms for the knapsack problem
- Stability of approximation algorithms or parameterization of the approximation ratio
- Improved approximation results for stochastic knapsack problems
- Approximation algorithms for knapsack problems with cardinality constraints
- Complexity results and exact algorithms for robust knapsack problems
- scientific article; zbMATH DE number 4127013
- Hardness of approximation for knapsack problems
- A new approximation algorithm for the knapsack problem
Cited in
(10)- On k-connectivity problems with sharpened triangle inequality
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
- Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs
- Stability of approximation algorithms for hard optimization problems
- Approximation Algorithms for the Traveling Salesman Problem with Range Condition
- A Stability Concept For Zero-One Knapsack Problems And Approximation Algorithms
- A Modern View on Stability of Approximation
- On the hardness and approximation of the densest k-subgraph problem in parameterized metric graphs
This page was built for publication: Stability of approximation algorithms and the knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941164)
