Parameterized approximation algorithms for packing problems

Parameterized Approximation is a topic of considerable interest in the field of Parameterized Complexity. In the past decade, new color coding-related techniques, including the breakthrough representative sets technique, have been proven extremely powerful in the design of fast parameterized algorit...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 648; S. 40 - 55
1. Verfasser:	Zehavi, Meirav
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 04.10.2016
Schlagworte:	3-Set k-packing Algorithms Approximation Color Design parameters Mathematical analysis Mathematical models Optimization Parameterized complexity Run time (computers) Universal sets Universal sets 3-Set k-packing Parameterized complexity
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!