Pages that link to "Item:Q2789264"
From MaRDI portal
The following pages link to Randomized approximation and online algorithms for assignment problems (Q2789264):
Displaying 8 items.
- On the online track assignment problem (Q423916) (← links)
- An on-line assignment problem with random effectiveness and costly information (Q581216) (← links)
- Randomized algorithms for on-line scheduling problems: How low can't you go? (Q1612009) (← links)
- Randomized Online Algorithms with High Probability Guarantees (Q2965509) (← links)
- Almost sure asymptotic optimality for online routing and machine scheduling problems (Q3057128) (← links)
- (Q3128899) (← links)
- The optimality of the online greedy algorithm in carpool and chairman assignment problems (Q3189021) (← links)
- (Q5743510) (← links)