The minimum backlog problem

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Theoretical Computer Science

• Publication date

  2015-11-09

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.tcs.2015.08.027
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Data harvesting with mobile elements in wireless sensor networks

  2014cited by this paper
• Cinderella versus the Wicked Stepmother

  2012cited by this paper
• The Cinderella Game on Holes and Anti-holes

  2011cited by this paper
• Ultra-low power data storage for sensor networks

  2009cited by this paper
• Optimal Backlog in the Plane

  2008cited by this paper
• Rethinking Data Management for Storage-centric Sensor Networks

  2007cited by this paper
• A review of TSP based approaches for flowshop scheduling

  2006cited by this paper
• Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks

  2005cited by this paper
• Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness

  2004cited by this paper
• Mobile element scheduling for efficient data collection in wireless sensor networks with dynamic deadlines

  2004cited by this paper
• Pursuit-evasion with imprecise target location

  2003cited by this paper
• A proportionate fair scheduling rule with good worst-case performance

  2003cited by this paper
• Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme

  2003cited by this paper
• Competitive On-Line Switching Policies

  2002cited by this paper
• Traveling salesmen in the presence of competition

  2002cited by this paper
• The Buuer Minimization Problem for Multiprocessor Scheduling with Connicts Icalp 2001 -submission for Track A

  2001cited by this paper
• The On-Line K-Server Problem

  1997cited by this paper
• On the k-server conjecture

  1995cited by this paper
• An Optimal On-Line Algorithm for k-Servers on Trees

  1991cited by this paper
• Competitive k-server algorithms

  1990cited by this paper
• Competitive Algorithms for Server Problems

  1990cited by this paper
• Two algorithms for maintaining order in a list

  1987cited by this paper
• Amortized efficiency of list update and paging rules

  1985cited by this paper
• The Traveling Salesman Problem with Many Visits to Few Cities

  1984cited by this paper
• The shortest path and the shortest road through n points

  1955cited by this paper

• A 10/7-Approximation for Discrete Bamboo Garden Trimming and Continuous Trimming on Star Graphs

  2023cites this paper
• Design and Development of UAV for Challange faced for Data Muling problem In Path

  2023cites this paper
• Trajectory Planing for Cooperating Unmanned Aerial Vehicles in the IoT

  2022cites this paper
• Perpetual maintenance of machines with different urgency requirements

  2022cites this paper
• GenSys: a scalable fixed-point engine for maximal controller synthesis over infinite state spaces

  2021cites this paper
• How asymmetry helps buffer management: achieving optimal tail size in cup games

  2021cites this paper
• Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game

  2019cites this paper
• Cooperative data muling using a team of unmanned aerial vehicles

  2019cites this paper
• Real-time data muling using a team of heterogeneous unmanned aerial vehicles

  2019cites this paper
• Achieving optimal backlog in multi-processor cup games

  2019influential citation
• Priority Scheduling in the Bamboo Garden Trimming Problem

  2019cites this paper
• Bamboo Garden Trimming Problem: Priority Schedulings

  2019cites this paper
• Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)

  2017cites this paper
• Cooperative data muling from ground sensors to base stations using UAVs

  2017cites this paper
• Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits

  2017cites this paper
• Perpetual maintenance of machines with different attendance urgency factors )

  2017cites this paper