A Nearly Quadratic-Time FPTAS for Knapsack.
Lin ChenJiayi LianYuchen MaoGuochuan ZhangPublished in: CoRR (2023)
Keyphrases
- knapsack problem
- dynamic programming
- approximation algorithms
- np hardness
- objective function
- upper bound
- real time
- pareto optimal
- np hard
- packing problem
- optimal solution
- pairwise
- timed automata
- computational complexity
- feasible solution
- knowledge representation
- data mining
- data structure
- image processing
- greedy heuristic
- knowledge base