Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems.
David R. KargerKrzysztof OnakPublished in: SODA (2007)
Keyphrases
- linear programming
- approximation schemes
- packing problem
- random instances
- bin packing
- integer programming
- phase transition
- polynomial size
- lower bound
- np hard
- approximation algorithms
- randomly generated
- constraint satisfaction problems
- random constraint satisfaction problems
- hard problems
- np complete problems
- sat instances
- search problems
- upper bound
- constraint satisfaction
- multi dimensional
- numerical methods
- random graphs
- np complete
- constraint programming
- worst case
- pattern databases
- combinatorial problems
- satisfiability problem
- sat problem
- higher dimensional
- multiscale
- data cube