Approximations and Hardness of Packing Partially Ordered Items.
Ilan Doron AradGuy KortsarzJoseph NaorBaruch SchieberHadas ShachnaiPublished in: CoRR (2024)
Keyphrases
- partially ordered
- partial order
- totally ordered
- partial ordering
- possibilistic logic
- event calculus
- total order
- computational complexity
- interval valued
- np complete
- worst case
- learning theory
- np hard
- packing problem
- information theoretic
- closed form
- phase transition
- agnostic learning
- data sets
- total ordering
- approximation methods
- efficient computation
- qualitative and quantitative
- constraint satisfaction
- special case
- reinforcement learning