Covering a tree with rooted subtrees -parameterized and approximation algorithms

Chen, L and Marx, Dániel (2018) Covering a tree with rooted subtrees -parameterized and approximation algorithms. In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (PA), pp. 2801-2820. ISBN 9781611975031 10.1137/1.9781611975031.178

[img] Text
Chen_2801_3370359_ny.pdf

Download (567kB)
Item Type: Book Section
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Informatics Laboratory
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 08 Jan 2019 16:22
Last Modified: 08 Jan 2019 16:22
URI: http://eprints.sztaki.hu/id/eprint/9561

Update Item Update Item