Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.

Jianer Chen, Iyad A. Kanj, Ge Xia

Browse the full ISAAC paper archive.