Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
Lise Getoor, Greger Ottosson, Markus P. J. Fromher...
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...
Pascal Van Hentenryck, Russell Bent, Yannis Vergad...