Ramsey-type theorems for metric spaces with applications to online problems
From MaRDI portal
Publication:2496321
Recommendations
Cites work
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 2079366 (Why is no real title available?)
- scientific article; zbMATH DE number 1559591 (Why is no real title available?)
- scientific article; zbMATH DE number 219640 (Why is no real title available?)
- scientific article; zbMATH DE number 845841 (Why is no real title available?)
- A decomposition theorem for task systems and bounds for randomized server problems
- A general decomposition theorem for the k-server problem
- A strongly competitive randomized paging algorithm
- A tight bound on approximating arbitrary metrics by tree metrics
- An optimal on-line algorithm for metrical task system
- Approximation algorithms for classification problems with pairwise relationships, metric labeling and Markov random fields
- Better Algorithms for Unfair Metrical Task Systems and Applications
- Competitive algorithms for server problems
- Competitive analysis of randomized paging algorithms
- Competitive paging algorithms
- Competitive snoopy caching
- Limitations to Fréchet's metric embedding method
- Lower Bounds for Randomized k-Server and Motion-Planning Algorithms
- ON METRIC RAMSEY-TYPE DICHOTOMIES
- On Hilbertian subsets of finite metric spaces
- On the k -server conjecture
- On the power of randomization in on-line algorithms
- Randomized algorithms for metrical task systems
- Some low distortion metric Ramsey problems
- Unfair problems and randomized algorithms for metrical task systems
Cited in
(21)- Nested convex bodies are chaseable
- Online computation with advice
- Metrical task systems on trees via mirror descent and unfair gluing
- Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
- Chasing convex bodies optimally
- Breaking the 2-competitiveness barrier for two servers in a tree
- Ultrametric subsets with large Hausdorff dimension
- A new construction technique of a triangle-free 3-colored K16's
- Competitive ratio vs regret minimization: achieving the best of both worlds
- scientific article; zbMATH DE number 1559591 (Why is no real title available?)
- Metrical service systems with transformations
- R-LINE: a better randomized 2-server algorithm on the line
- Advances in metric embedding theory
- Asymptotic negative type properties of finite ultrametric spaces
- A note on restricted online Ramsey numbers of matchings
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- Randomized algorithm for the \(k\)-server problem on decomposable spaces
- Dvoretzky-type theorem for locally finite subsets of a Hilbert space
- Euclidean quotients of finite metric spaces
- An introduction to the Ribe program
- Quantitative geometry
This page was built for publication: Ramsey-type theorems for metric spaces with applications to online problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496321)
