NTHRYS › PhD Assistance › Algorithm Design Complexity

Algorithm Design Complexity

Field

▾

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Approximation Hardness for Packing Problems

Establishes approximation lower bounds for bin packing, rectangle packing, and sphere packing using PCP and inapproximability techniques.