An O ∗ ( 3.5 3 3 k ) -time parameterized algorithm for the 3-set packing problem

A parameterized algorithm for the well-known NP-complete problem 3- set packing is presented. The algorithm is based on the following new approaches: (1) an efficient algorithm for problem instances in which one element is known for each of the 3-sets in a solution packing (i.e., type-1 instances);...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science Jg. 412; H. 18; S. 1745 - 1753
Hauptverfasser:	Wang, Jianxin, Feng, Qilong, Chen, Jianer
Format:	Journal Article Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	Oxford Elsevier B.V 15.04.2011 Elsevier
Schlagworte:	3-set packing [formula omitted]-universal set Algorithmics. Computability. Computer arithmetics Applied sciences Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Designs and configurations Divide and conquer Exact sciences and technology Mathematics Miscellaneous Sciences and techniques of general use Theoretical computing ( n , k ) -universal set 3-set packing Divide and conquer Upper bound Packing Computer theory (n. k)-universal set Decomposition method NP complete problem Algorithm
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!