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

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 648; pp. 40 - 55
Main Author:	Zehavi, Meirav
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 04.10.2016
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!