Pages that link to "Item:Q4326854"
From MaRDI portal
The following pages link to A Graph-Theoretic Game and Its Application to the <i>k</i>-Server Problem (Q4326854):
Displaying 9 items.
- Models and algorithms for network reduction (Q320811) (← links)
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q4622772) (← links)
- Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition (Q5002702) (← links)
- (Q5090925) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Lower bounds for strictly fundamental cycle bases in grid graphs (Q5191140) (← links)
- Stochastic approximation of lamplighter metrics (Q6048880) (← links)
- Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121) (← links)
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)
