227 search results - page 12 / 46 » Weighted Coloring: Further Complexity and Approximability Re... |
COMPSEC
2010
13 years 6 months ago
2010
In this paper we address the problem of reducing the role mining complexity in RBAC systems. To this aim, we propose a three steps methodology: first, we associate a weight to rol...
EOR
2008
13 years 7 months ago
2008
The car sequencing problem consists in sequencing a given set of cars to be produced in a single day. We address one of the variants of this problem, in which the objective of mini...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
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 ...
FOCS
1993
IEEE
13 years 12 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...