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

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithmica Ročník 75; číslo 2; s. 383 - 402
Hlavní autoři:	Gutin, Gregory, Kratsch, Stefan, Wahlström, Magnus
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.06.2016
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!