Pages that link to "Item:Q402379"
From MaRDI portal
The following pages link to On the advice complexity of online bipartite matching and online stable marriage (Q402379):
Displaying 12 items.
- Minimum cost perfect matching with delays for two sources (Q1628601) (← links)
- The advice complexity of a class of hard online problems (Q1693995) (← links)
- PROM: efficient matching query processing on high-dimensional data (Q1750027) (← links)
- Stable secretaries (Q1999964) (← links)
- Temporal matching (Q2285132) (← links)
- Advice complexity of online non-crossing matching (Q2678256) (← links)
- Temporal matching on geometric graph data (Q2692739) (← links)
- Online Matching in Regular Bipartite Graphs (Q5087843) (← links)
- Impatient Online Matching (Q5091056) (← links)
- Minimum Cost Perfect Matching with Delays for Two Sources (Q5283368) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)
- Randomized algorithm for MPMD on two sources (Q6609154) (← links)
