Abstract

We address the question of whether the primal–dual approach for the design and analysis of online algorithms can be applied to nonmonotone problems. We provide a positive answer by presenting a primal–dual analysis to the online algorithm of Awerbuch et al. [3] for routing virtual circuits with unknown durations.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call