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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 75; H. 2; S. 383 - 402
Hauptverfasser:	Gutin, Gregory, Kratsch, Stefan, Wahlström, Magnus
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.06.2016
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!