On the approximability of clique and related maximization problems

Author： Srinivasan A.  

Publisher： Elsevier

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.67, Iss.3, 2003-11, pp. : 633-651

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

Related content

Approximability of hard combinatorial optimization problems: an introduction

By Maffioli Francesco   Galbiati Giulia  

Annals of Operations Research, Vol. 96, Iss. 1-4, 2000-11 ,pp. : 221-236

Springer Publishing Company

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

Approximability results for stable marriage problems with ties

By Halldorsson M.M.   Irving R.W.   Iwama K.   Manlove D.F.   Miyazaki S.   Morita Y.   Scott S.  

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 431-447

Elsevier

Access to resources Recommend Favorite

A Numerical Approach for Solving Some Convex Maximization Problems

By Enkhbat R.   Barsbold B.   Kamada Masaru  

Journal of Global Optimization, Vol. 35, Iss. 1, 2006-05 ,pp. : 85-101

Springer Publishing Company

Access to resources Recommend Favorite

Piece adding technique for convex maximization problems

By Fortin Dominique   Tseveendorj Ider  

Journal of Global Optimization, Vol. 48, Iss. 4, 2010-12 ,pp. : 583-593

Springer Publishing Company

Access to resources Recommend Favorite