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

Jianer Chen, Iyad A. Kanj, Ge Xia. Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. Algorithmica, 43(4):245-273, 2005. [doi]

Abstract

Abstract is missing.