On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem

Sounaka Mishra, Kripasindhu Sikdar. On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem. In Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito, editors, Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings. Volume 1872 of Lecture Notes in Computer Science, pages 186-199, Springer, 2000. [doi]

Abstract

Abstract is missing.