Algorithm Design Complexity

Research Frontiers in Approximation Algorithms for Longest Path Problems

Study of approximation and inapproximability results for longest path, longest cycle, and related graph problems.

All Algorithm Design & Complexity PhD categories