Approximability results for stable marriage problems with ties

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

Publisher： Elsevier

ISSN： 0304-3975

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

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

Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties

By Marx Dániel   Schlotter Ildikó  

Algorithmica, Vol. 58, Iss. 1, 2010-09 ,pp. : 170-187

Springer Publishing Company

Access to resources Recommend Favorite

On the approximability of clique and related maximization problems

By Srinivasan A.  

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

Elsevier

Access to resources Recommend Favorite

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

Hard variants of stable marriage

By Manlove  

Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. : 261-279

Elsevier

Access to resources Recommend Favorite