Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem

The workflow satisfiability problem ( wsp ) is a problem of practical interest that arises whenever tasks need to be performed by authorized users, subject to constraints defined by business rules. We are required to decide whether there exists a plan —an assignment of tasks to authorized users—such...

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 75; no. 2; pp. 383 - 402
Main Authors:	Gutin, Gregory, Kratsch, Stefan, Wahlström, Magnus
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.06.2016
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Workflow satisfiability problem Parameterized complexity Kernelization
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!