ASCEND
BY NTHRYS

NTHRYSPhD AssistanceAlgorithm Design Complexity

Algorithm Design Complexity

Field
Category

Algorithm Design Complexity

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Approximation Algorithms for Geometric Packing

Development and analysis of approximation algorithms for optimal packing of geometric objects in bounded spaces with applications to logistics and manufacturing.

All Algorithm Design & Complexity PhD categories