Research Seminar
before a job's slack becomes less than a δ-fraction of its size, we prove a competitive ratio of O(ε⋅((ε−δ)δ2)−1), for 0<δ<ε. When a provider must commit upon starting a job, our bound is O(ε−2). A stronger [...] Constraints Abstract We study a bilevel optimization problem which is a zero-sum Stackelberg game. In this problem, there are two players, a leader and a follower, who pick items from a common set. Both the leader [...] of "holes" in a graph. We call an induced cycle of length a least four a hole and the parity of a hole is the parity of its length. In 1991, Bienstock showed it is NP-Hard to test whether a graph G has an