- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Approximating Multistage Matching Problems ; day:23 ; month:3 ; year:2022 ; pages:1-19
Algorithmica ; (23.3.2022), 1-19
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-022-00951-x
- URN
-
urn:nbn:de:101:1-2022061419161073199739
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:35 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Chimani, Markus
- Troost, Niklas
- Wiedera, Tilo
- SpringerLink (Online service)
Other Objects (12)
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds
Approximating the product knapsack problem
Approximating the product knapsack problem
Approximating Perpetuities
Approximating data and statistical procedures. I. Approximating data
Approximating Data and Statistical Procedures - I. Approximating Data
Approximating biobjective minimization problems using general ordering cones
Approximating the probabilistic p-Center problem under pressure
Approximating Walrasian Equilibria
Approximating solution structure
Approximating least fixpoints
A moment-matching method for approximating vector autoregressive processes by finite-state Markov chains
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds
Approximating the product knapsack problem
Approximating the product knapsack problem
Approximating Perpetuities
Approximating data and statistical procedures. I. Approximating data
Approximating Data and Statistical Procedures - I. Approximating Data
Approximating biobjective minimization problems using general ordering cones
Approximating the probabilistic p-Center problem under pressure
Approximating Walrasian Equilibria
Approximating solution structure
Approximating least fixpoints
A moment-matching method for approximating vector autoregressive processes by finite-state Markov chains
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds
Approximating the product knapsack problem
Approximating the product knapsack problem
Approximating Perpetuities
Approximating data and statistical procedures. I. Approximating data
Approximating Data and Statistical Procedures - I. Approximating Data
Approximating biobjective minimization problems using general ordering cones
Approximating the probabilistic p-Center problem under pressure
Approximating Walrasian Equilibria
Approximating solution structure
Approximating least fixpoints