Browsing Computer Science and Automation (CSA) by Subject "approximation algorithms"
Now showing items 1-2 of 2
-
Approximation Algorithms for Geometric Packing Problems
We study approximation algorithms for the geometric bin packing problem and its variants. In the two-dimensional geometric bin packing problem (2D GBP), we are given n rectangular items and we have to compute an axis-parallel ... -
Recovery Algorithms for planted structures in Semi-random models
For many NP-hard problems, the analysis of best-known approximation algorithms yields “poor” worst-case guarantees. However, using various heuristics, the problems can be solved (to some extent) in real-life instances. ...