Representative families: A unified tradeoff-based approach

Hadas Shachnai, Meirav Zehavi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

22 Scopus citations


Let M = (E, I)be a matroid, and let S be a family of subsets of size p of E. A subfamily Ŝ⊆S represents if for every pair of sets X ε S and Y ⊆ E \X such that X ∪ Y ε I, there is a set X̂ε Ŝ disjoint from Y such that X̂ ∪ Y ε I.. Fomin et al. (Proc. ACM-SIAM Symposium on Discrete Algorithms, 2014) introduced a powerful technique for fast computation of representative families for uniform matroids. In this paper, we show that this technique leads to a unified approach for substantially improving the running times of parameterized algorithms for some classic problems. This includes, among others, k -Partial Cover, k -Internal Out-Branching, and Long Directed Cycle. Our approach exploits an interesting tradeoff between running time and the size of the representative families.

Original languageEnglish
Title of host publicationAlgorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783662447765
StatePublished - 1 Jan 2014
Externally publishedYes
Event22nd Annual European Symposium on Algorithms, ESA 2014 - Wroclaw, Poland
Duration: 8 Sep 201410 Sep 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8737 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference22nd Annual European Symposium on Algorithms, ESA 2014

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Representative families: A unified tradeoff-based approach'. Together they form a unique fingerprint.

Cite this