Pages that link to "Item:Q5417603"
From MaRDI portal
The following pages link to A 1.43-competitive online graph edge coloring algorithm in the random order arrival model (Q5417603):
Displaying 5 items.
- The greedy algorithm is optimal for on-line edge coloring (Q1209350) (← links)
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- New results for the \(k\)-secretary problem (Q2658048) (← links)
- Online graph edge-coloring in the random-order arrival model (Q3191564) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)