Approximability Results for Stable Marriage Problems With Ties

Theoretical Computer Science - Netherlands
doi 10.1016/s0304-3975(03)00321-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

The Approximability of Constraint Satisfaction Problems

SIAM Journal on Computing
MathematicsComputer Science
2001English

The Structure of Stable Marriage With Indifference

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2002English

Complexity Study for the Robust Stable Marriage Problem

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

An Extended Stable Marriage Problem Algorithm for Clone Detection

International Journal of Software Engineering & Applications
2014English

Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine

1996English

The Parallel Approximability of the False and True Gates Problems for NOR-Circuits

Parallel Processing Letters
HardwareTheoretical Computer ScienceArchitectureSoftware
2002English

Christian Raffensperger. Ties of Kinship: Genealogy and Dynastic Marriage in Kyivan Rus'.

East/West: Journal of Ukrainian Studies
2018English

Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy