On the Hardness of Approximating Some NP-optimization...

RAIRO - Theoretical Informatics and Applications 2001 / 05 Vol. 35; Iss. 3

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

Mishra, Sounaka, Sikdar, Kripasindhu
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
35
Language:
english
Journal:
RAIRO - Theoretical Informatics and Applications
DOI:
10.1051/ita:2001121
Date:
May, 2001
File:
PDF, 254 KB
english, 2001
Conversion to is in progress
Conversion to is failed