Pages that link to "Item:Q4210157"
From MaRDI portal
The following pages link to Competitive Algorithms for Layered Graph Traversal (Q4210157):
Displaying 15 items.
- The \(k\)-server problem (Q458484) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- On the two-dimensional cow search problem (Q987818) (← links)
- On convex body chasing (Q1207798) (← links)
- Constructing competitive tours from local information (Q1331954) (← links)
- Competitive algorithms for the weighted server problem (Q1331957) (← links)
- An iterative procedure for evaluating digraph competitions (Q1614130) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Competitive distributed decision-making (Q1920425) (← links)
- Metrical service systems with multiple servers (Q2258084) (← links)
- Intuitionistic Layered Graph Logic (Q2817944) (← links)
- Treasure Hunt with Advice (Q3460725) (← links)
- (Q4213379) (← links)
- Traversing Layered Graphs Using the Work Function Algorithm (Q4881405) (← links)
- Better Bounds for Online Line Chasing (Q5092366) (← links)