Monografie
Stable matchings beyond stable marriage: models, algorithms, complexity
- Sprache
-
Englisch
- Identifier
-
1278427155
Thema
Mustervergleich; Matching; Berechnungskomplexität; NP-hartes Problem; Matching-Problem; Effizienter Algorithmus; Graph
Beteiligte Personen und Organisationen
Heeger, Klaus
Niedermeier, Rolf
Brill, Markus
Manlove, David
Saurabh, Saket
Niedermeier, Rolf
Brill, Markus
Manlove, David
Saurabh, Saket
- DOI
-
10.14279/depositonce-16756
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
02.05.2023, 09:12 MESZ
Objekttyp
- Monografie
Beteiligte
- Heeger, Klaus
- Niedermeier, Rolf
- Brill, Markus
- Manlove, David
- Saurabh, Saket
Ähnliche Objekte (12)
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Fine-Grained Parameterized Algorithms on Width Parameters and Beyond
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Parameterized algorithmics for time-evolving structures: temporalizing and multistaging
Efficient parameterized algorithms on structured graphs
Competitive and voting location
Application-oriented collective decision making: experimental toolbox and dynamic environments
Complexity of bulk-robust combinatorial optimization problems
Multivariate Algorithmics in Biological Data Analysis
Effiziente Algorithmen für baumstrukturierte Graphklassen
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Models and algorithms for scalable collective decision making
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Fine-Grained Parameterized Algorithms on Width Parameters and Beyond
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Parameterized algorithmics for time-evolving structures: temporalizing and multistaging
Efficient parameterized algorithms on structured graphs
Competitive and voting location
Application-oriented collective decision making: experimental toolbox and dynamic environments
Complexity of bulk-robust combinatorial optimization problems
Multivariate Algorithmics in Biological Data Analysis
Effiziente Algorithmen für baumstrukturierte Graphklassen
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Models and algorithms for scalable collective decision making
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Fine-Grained Parameterized Algorithms on Width Parameters and Beyond
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Parameterized algorithmics for time-evolving structures: temporalizing and multistaging
Efficient parameterized algorithms on structured graphs
Competitive and voting location
Application-oriented collective decision making: experimental toolbox and dynamic environments
Complexity of bulk-robust combinatorial optimization problems
Multivariate Algorithmics in Biological Data Analysis
Effiziente Algorithmen für baumstrukturierte Graphklassen
Exact algorithms for NP hard problems on networks : design, analysis and implementation