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 31 items.
- Models and algorithms for network reduction (Q320811) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
- \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees (Q634672) (← links)
- Approximating snowflake metrics by trees (Q723016) (← links)
- A randomized algorithm for the on-line weighted bipartite matching problem (Q835627) (← links)
- A network game with attackers and a defender (Q930603) (← links)
- Minimum cut bases in undirected networks (Q968141) (← links)
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- Random martingales and localization of maximal inequalities (Q982510) (← links)
- Counting distance permutations (Q1013072) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- Randomized algorithm for the \(k\)-server problem on decomposable spaces (Q1044025) (← links)
- Minimum restricted diameter spanning trees. (Q1427810) (← links)
- On approximating planar metrics by tree metrics. (Q1603386) (← links)
- Low complexity variants of the arrow distributed directory (Q1604202) (← links)
- Engineering a combinatorial Laplacian solver: lessons learned (Q1736844) (← links)
- The mixed Lipschitz space and its dual for tree metrics (Q1742818) (← links)
- Maximum gradient embeddings and monotone clustering (Q1945290) (← links)
- Electrical flows over spanning trees (Q2097649) (← links)
- Covering metric spaces by few trees (Q2168848) (← 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)
