On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems

By Amaldi E.   Kann V.  

Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. : 237-260

Elsevier

Access to resources Recommend Favorite

On the complexity of finding a local maximum of functions on discrete planar subsets

By Mityagin A.  

Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. : 355-363

Elsevier

Access to resources Recommend Favorite

On the approximability of some Maximum Spanning Tree Problems

By Galbiati G.   Morzenti A.   Maffioli F.  

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 107-118

Elsevier

Access to resources Recommend Favorite

Project scheduling with irregular costs: complexity, approximability, and algorithms

By Grigoriev Alexander   Woeginger Gerhard  

Acta Informatica, Vol. 41, Iss. 2-3, 2004-12 ,pp. : 83-97

Springer Publishing Company

Access to resources Recommend Favorite

General linear relations between different types of predictive complexity

By Kalnishkan  

Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. : 181-200

Elsevier

Access to resources Recommend Favorite