In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
Role mining algorithms address an important access control problem: configuring a role-based access control system. Given a direct assignment of users to permissions, role mining...
Mario Frank, Andreas P. Streich, David A. Basin, J...
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a nu...
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan