Generosity Helps or an 11-Competitive Algorithm for Three Servers
From MaRDI portal
Recommendations
Cited in
(25)- Tight spans of distances and the dual fractionality of undirected multiflow problems
- Manhattan orbifolds
- A T_X-approach to some results on cuts and metrics
- Competitive analysis of randomized paging algorithms
- The polytopal structure of the tight-span of a totally split-decomposable metric
- Searching for realizations of finite metric spaces in tight spans
- On tight spans for directed distances
- Metric packing for \(K_ 3 + K_ 3\)
- Injective subsets of \(l_{\infty}(I)\)
- Mini-workshop: Nonpositively curved complexes. Abstracts from the mini-workshop held February 7--13, 2021 (online meeting)
- Completeness in generalized ultrametric spaces
- Injective metrizability and the duality theory of cubings
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
- On di-injective \(T_{0}\)-quasi-metric spaces
- Obtaining splits from cut sets of tight spans
- The tight span of an antipodal metric space. I: combinatorial properties
- Injective hulls of certain discrete metric spaces and groups.
- Trees, tight-spans and point configurations
- The \(k\)-server problem
- scientific article; zbMATH DE number 742965 (Why is no real title available?)
- STACS 2004
- Coarse injectivity, hierarchical hyperbolicity and semihyperbolicity
- Helly groups
- On the structure of the tight-span of a totally split-decomposable metric
- Some characterizations of ultrametrically injective spaces
This page was built for publication: Generosity Helps or an 11-Competitive Algorithm for Three Servers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285911)