Polylog(n)-competitive algorithm for metrical task systems

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1997, Pages 711-719

  Bartal, Yair ^a   Blum, Avrim ^a   Burch, Carl ^a   Tomkins, Andrew ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBABILITY; TREES (MATHEMATICS);

METRIC SPACES; METRICAL TASK SYSTEMS;

ONLINE SYSTEMS;

EID: 0030643389     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)