3 research outputs found
A Multivariate Approach for Checking Resiliency in Access Control
In recent years, several combinatorial problems were introduced in the area
of access control. Typically, such problems deal with an authorization policy,
seen as a relation , where means that
user is authorized to access resource . Li, Tripunitara and Wang (2009)
introduced the Resiliency Checking Problem (RCP), in which we are given an
authorization policy, a subset of resources , as well as
integers , and . It asks whether upon removal of
any set of at most users, there still exist pairwise disjoint sets of
at most users such that each set has collectively access to all resources
in . This problem possesses several parameters which appear to take small
values in practice. We thus analyze the parameterized complexity of RCP with
respect to these parameters, by considering all possible combinations of . In all but one case, we are able to settle whether the problem is in
FPT, XP, W[2]-hard, para-NP-hard or para-coNP-hard. We also consider the
restricted case where for which we determine the complexity for all
possible combinations of the parameters
Algorithmic Aspects in Information and Management [electronic resource] : 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings /
This volume constitutes the proceedings of the 11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016, held in Bergamo, Italy, in July 2016. The 18 revised full papers presented were carefully reviewed and selected from 41 submissions. The papers deal with current trends of research on algorithms, data structures, operation research, combinatorial optimization and their applications.Item Pricing for Combinatorial Public Projects -- Norm-Based Locality Measures of Two-Dimensional Hilbert Curves -- On the Complexity of Clustering with Relaxed Size Constraints -- Superstring Graph: A New Approach for Genome Assembly -- Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees -- A Very Fast String Matching Algorithm Based on Condensed Alphabets -- Minimum-Density Identifying Codes in Square Grids -- Separating Codes and Traffic Monitoring -- Know When to Persist: Deriving Value from a Stream Buffer -- Algorithmic Aspects of Upper Domination: A Parameterised Perspective -- On Network Formation Games with Heterogeneous Players and Basic Network Creation Games -- Parameterized Complexity of Team Formation in Social Networks -- Reconstructing Cactus Graphs from Shortest Path Information -- Near-Optimal Dominating Sets via Random Sampling -- A Multivariate Approach for Checking Resiliency in Access Control -- Efficient Algorithms for the Order Preserving Pattern Matching Problem -- Computing the Line-Constrained k-Center in the Plane for Small k -- Online k-max Search Algorithm with Applications to the Secretary Problem.This volume constitutes the proceedings of the 11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016, held in Bergamo, Italy, in July 2016. The 18 revised full papers presented were carefully reviewed and selected from 41 submissions. The papers deal with current trends of research on algorithms, data structures, operation research, combinatorial optimization and their applications