The minimum backlog problem

DOI10.1016/J.TCS.2015.08.027MaRDI QIDQ888427zbMATH OpenOpenAlexFDO

Authors Michael A. Bender, Sándor P. Fekete, Alexander Kröller, Vincenzo Liberatore, Joseph S. B. Mitchell, Valentin Polishchuk, 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

online algorithmscomputational geometrycompetitive analysisgames on graphs

Mathematics Subject Classification ID

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

Recommendations

• Algorithm Theory - SWAT 2004
• The bottleneck problem with minimum quantity commitments
• scientific article; zbMATH DE number 2090008
• The minimum latency problem
• The shortest queue problem
• On the minimum delay problem
• The Directed Minimum Latency Problem
• The min-conflict packing problem

Cites work

• scientific article; zbMATH DE number 2079407 (Why is no real title available?)
• scientific article; zbMATH DE number 2080979 (Why is no real title available?)
• scientific article; zbMATH DE number 1754640 (Why is no real title available?)
• scientific article; zbMATH DE number 2119707 (Why is no real title available?)
• A review of TSP based approaches for flowshop scheduling
• An Optimal On-Line Algorithm for K Servers on Trees
• Cinderella versus the wicked stepmother
• Competitive algorithms for server problems
• Data harvesting with mobile elements in wireless sensor networks
• Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
• On the k -server conjecture
• The Cinderella Game on Holes and Anti-holes
• The Traveling Salesman Problem with Many Visits to Few Cities
• The shortest path and the shortest road through n points
• Traveling salesmen in the presence of competition

Cited in

(4)

• Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)
• Bamboo garden trimming problem: priority schedulings
• Perpetual maintenance of machines with different urgency requirements
• Perpetual scheduling with explorable uncertainty

This page was built for publication: The minimum backlog problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q888427)