Online Graph Balancing and the Power of Two Choices

In the classic online graph balancing problem, edges arrive sequentially and must be oriented immediately upon arrival, to minimize the maximum in-degree. For adversarial arrivals, the natural greedy algorithm is O(\log n)-competitive, and this bound is the best possible for any algorithm, even wi…

View Post on Scour ↗

More from arxiv.org on Scour.