Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
ss domain. Using this more abstract approach means that more data sources of varying types can be incorporated with less effort, and such heterogeneous data sources might be very r...
— Multimedia Broadcast Multicast Service (MBMS) epitomizes the increasing popularity of enhanced end-user experience in Universal Mobile Telecommunications System (UMTS), since i...
Antonios G. Alexiou, Christos Bouras, Evangelos Re...
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...