ScholarLens Back to search
2020•AlgorithmicaOpen access

On the Approximability of the Stable Matching Problem with Ties of Size Two

Robert Chiang, Kanstantsin Pashkovich

Open full text 0 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Cardinality (data modeling), Matching (statistics), Approximation algorithm, Mathematics, Combinatorics, Constant (computer programming), Stable marriage problem, Cardinal number (linguistics)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On the Approximability of the Stable Matching Problem with Ties of Size Two — Research Paper | ScholarLens