Complexity Study for the Robust Stable Marriage Problem

Theoretical Computer Science - Netherlands
doi 10.1016/j.tcs.2018.12.017
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

An Extended Stable Marriage Problem Algorithm for Clone Detection

International Journal of Software Engineering & Applications
2014English

The Complexity of Restricted Variants of the Stable Paths Problem

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2010English

A 25/17-Approximation Algorithm for the Stable Marriage Problem With One-Sided Ties

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

On the Complexity of the Robust Stability Problem for Linear Parameter Varying Systems

IFAC Proceedings Volumes
1996English

The Structure of Stable Marriage With Indifference

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2002English

Approximability Results for Stable Marriage Problems With Ties

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2003English

The Stable Roommates Problem

Algorithmics of Matching Under Preferences
2013English

Robust Approaches for the Data Association Problem

2005English

The Complexity of the List Partition Problem for Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy