Jianer Chen, Iyad A. Kanj, Ge Xia. Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. In Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono, editors, Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings. Volume 2906 of Lecture Notes in Computer Science, pages 148-157, Springer, 2003. [doi]
Abstract is missing.