Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms

DOI10.1137/1.9781611973402.10zbMath1421.68077arXiv1304.4626MaRDI QIDQ5383969

Fedor V. Fomin, Saket Saurabh, Daniel Lokshtanov

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.4626

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W40: Analysis of algorithms

68W05: Nonnumerical algorithms

68R05: Combinatorics in computer science

68R10: Graph theory (including graph drawing) in computer science

05B35: Combinatorial aspects of matroids and geometric lattices