The minimum backlog problem

DOI10.1016/j.tcs.2015.08.027zbMath1330.68350OpenAlexW1935687795MaRDI QIDQ888427

Sándor P. Fekete, Alexander Kröller, Vincenzo Liberatore, Michael A. Bender, Valentin Polishchuk, Joseph S. B. Mitchell, Jukka Suomela

Publication date: 30 October 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.08.027

zbMATH Keywords

competitive analysisonline algorithmsgames on graphscomputational geometry

Mathematics Subject Classification ID

Games involving graphs (91A43) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Online algorithms; streaming algorithms (68W27)

Related Items (3)

Perpetual maintenance of machines with different urgency requirements ⋮ Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors) ⋮ Bamboo garden trimming problem: priority schedulings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Traveling salesmen in the presence of competition
• Data harvesting with mobile elements in wireless sensor networks
• A review of TSP based approaches for flowshop scheduling
• Cinderella versus the Wicked Stepmother
• The Cinderella Game on Holes and Anti-holes
• An Optimal On-Line Algorithm for K Servers on Trees
• The shortest path and the shortest road through n points
• The Traveling Salesman Problem with Many Visits to Few Cities
• Competitive algorithms for server problems
• On the k -server conjecture
• Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme

This page was built for publication: The minimum backlog problem