- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings ; day:15 ; month:5 ; year:2021 ; pages:1-19
Algorithmica ; (15.5.2021), 1-19
- Urheber
-
Hamada, Koki
Miyazaki, Shuichi
Okamoto, Kazuya
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-021-00832-9
- URN
-
urn:nbn:de:101:1-2021060419334622354314
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:59 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Hamada, Koki
- Miyazaki, Shuichi
- Okamoto, Kazuya
- SpringerLink (Online service)
Ähnliche Objekte (12)
Understanding popular matchings via stable matchings
Stable matchings beyond stable marriage: models, algorithms, complexity
Assigning Refugees to Landlords in Sweden: Efficient Stable Maximum Matchings
Stable Matchings for the Room-mates Problem
Stable Matchings for a Generalised Marriage Problem
A Review of the Existence of Stable Roommate Matchings
Stable matchings with covering constraints: a complete computational trichotomy
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy
“Almost-stable” matchings in the Hospitals / Residents problem with Couples
Flowerfree finding of maximum matchings
Searching Randomly for Maximum Matchings
Fractional solutions for capacitated NTU-games, with applications to stable matchings
Understanding popular matchings via stable matchings
Stable matchings beyond stable marriage: models, algorithms, complexity
Assigning Refugees to Landlords in Sweden: Efficient Stable Maximum Matchings
Stable Matchings for the Room-mates Problem
Stable Matchings for a Generalised Marriage Problem
A Review of the Existence of Stable Roommate Matchings
Stable matchings with covering constraints: a complete computational trichotomy
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy
“Almost-stable” matchings in the Hospitals / Residents problem with Couples
Flowerfree finding of maximum matchings
Searching Randomly for Maximum Matchings
Fractional solutions for capacitated NTU-games, with applications to stable matchings
Understanding popular matchings via stable matchings
Stable matchings beyond stable marriage: models, algorithms, complexity
Assigning Refugees to Landlords in Sweden: Efficient Stable Maximum Matchings
Stable Matchings for the Room-mates Problem
Stable Matchings for a Generalised Marriage Problem
A Review of the Existence of Stable Roommate Matchings
Stable matchings with covering constraints: a complete computational trichotomy
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy
“Almost-stable” matchings in the Hospitals / Residents problem with Couples
Flowerfree finding of maximum matchings
Searching Randomly for Maximum Matchings