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

Author： Mishra Sounaka   Sikdar Kripasindhu  

Publisher： Edp Sciences

E-ISSN： 1290-385x|35|3|287-309

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.35, Iss.3, 2010-03, pp. : 287-309

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications

By Bampis Evripidis   Giroudeau R.   König J.-C.  

RAIRO - Operations Research, Vol. 36, Iss. 1, 2010-03 ,pp. : 21-36

Edp Sciences

Access to resources Recommend Favorite

The partial inverse minimum cut problem with L1-norm is strongly NP-hard

By Gassner Elisabeth  

RAIRO - Operations Research, Vol. 44, Iss. 3, 2010-10 ,pp. : 241-249

Edp Sciences

Access to resources Recommend Favorite

On some problems related to palindrome closure

By Bucci Michelangelo   de Luca Aldo   De Luca Alessandro   Zamboni Luca Q.  

RAIRO - Theoretical Informatics and Applications, Vol. 42, Iss. 4, 2008-01 ,pp. : 679-700

Edp Sciences

Access to resources Recommend Favorite

Linear time algorithms to solve the linear ordering problem for oriented tree based graphs

By Quilliot Alain   Rebaine Djamal  

RAIRO - Operations Research, Vol. 50, Iss. 2, 2016-03 ,pp. : 315-325

Edp Sciences

Access to resources Recommend Favorite

Approximating head-related transfer functions of snowman model using perturbation method

By Yu Guang-zheng   Xie Bo-sun   Rao Dan  

INTER-NOISE and NOISE-CON Congress and Conference Proceedings, Vol. 2008, Iss. 8, 2008-10 ,pp. : 1675-1684

Institute of Noise Control Engineering

Access to resources Recommend Favorite