A Ramsey-type theorem for metric spaces and its applications for Metrical Task Systems and related problems

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 396-405

  Bartal, Yair ^a   Bollobás, Béla ^b   Mendel, Manor ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b UNIVERSITY OF MEMPHIS   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

METRIC SPACES; METRIC TASK SYSTEMS;

RANDOM PROCESSES;

EID: 0035186676     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2001.959914     Document Type: Article

References (19)

1. Buy-at-bulk network design
2. Heat and dump: Competitive distributed paging
3. Probabilistic approximations of metric space and its algorithmic application
4. On approximating arbitrary metrics by tree metrics
5. A polylog(n)-competitive algorithm for metrical task systems
6. Approximating min-sum k-clustering in metric spaces
7. A decomposition theorem and lower bounds for randomized server problems
8. An optimal online algorithm for metrical task systems
9. Competitive paging algorithms
10. Better algorithms for unfair metrical task systems and applications
11. Lower bounds for randomized k-server and motion-planning algorithms
12. Approximation algorithms for classification problems with pairwise relationships: Metric labeling and markov random fields
13. An approximation algorithm for the covering steiner problem
14. On the k-server conjecture
15. Competitive algorithms for server problems
16. Ramsey-like properties for bi-lipschitz embeddings of finite mettle spaces
17. Unfair problems and randomized algorithms for metrical task systems
18. A general decomposition theorem for the k-server problem