Arc consistency plays a central role in solving Constraint Satisfaction Problems. This is the reason why many algorithms have been proposed to establish it. Recently, an algorithm ...
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...