Pages that link to "Item:Q4606307"
From MaRDI portal
The following pages link to On the power of advice and randomization for online bipartite matching (Q4606307):
Displaying 13 items.
- On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← links)
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
- Temporal matching (Q2285132) (← links)
- Advice complexity of online non-crossing matching (Q2678256) (← links)
- Temporal matching on geometric graph data (Q2692739) (← links)
- Weighted Online Problems with Advice (Q2819501) (← links)
- A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version (Q5240422) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- Advice complexity of priority algorithms (Q5916086) (← links)
- Online bin covering with advice (Q5925507) (← links)
- An Experimental Study of Algorithms for Online Bipartite Matching (Q6039931) (← links)
- The power of multiple choices in online stochastic matching (Q6083465) (← links)
- Fully Online Matching with Advice on General Bipartite Graphs and Paths (Q6163625) (← links)