Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints

DOI10.1007/978-3-642-38756-2_21zbMath1303.68067arXiv1210.3978OpenAlexW2962968862MaRDI QIDQ5405930

No author found.

Publication date: 3 April 2014

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.3978

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of organizations, manpower planning in operations research (90B70)

Related Items (2)

Polynomial kernels and user reductions for the workflow satisfiability problem ⋮ Parameterized Complexity of the Workflow Satisfiability Problem

This page was built for publication: Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints