Pages that link to "Item:Q744081"
From MaRDI portal
The following pages link to On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles (Q744081):
Displaying 6 items.
- On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
- Online multi-coloring with advice (Q2355706) (← links)
- The secretary problem with reservation costs (Q2695326) (← links)
- On Energy-Efficient Computations With Advice (Q3196431) (← links)
- Online Minimum Spanning Tree with Advice (Q5895056) (← links)
- Online \(L(2,1)\)-coloring problem on paths with restricted size of memory (Q6043925) (← links)
