The stable marriage problem with restricted pairs

Author： Dias V.M.F. da Fonseca G.D. de Figueiredo C.M.H. Szwarcfiter J.L.

Publisher： Elsevier

ISSN： 0304-3975

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

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

Better and Simpler Approximation Algorithms for the Stable Marriage Problem

By Király Zoltán

Algorithmica, Vol. 60, Iss. 1, 2011-05 ,pp. : 3-20

Springer Publishing Company

Access to resources Recommend Favorite

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

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

Manipulation complexity and gender neutrality in stable marriage procedures

By Pini Maria

Autonomous Agents and Multi-Agent Systems, Vol. 22, Iss. 1, 2011-01 ,pp. : 183-199

Springer Publishing Company

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