Representative families: A unified tradeoff-based approach

Hadas Shachnai; Meirav Zehavi

doi:10.1007/978-3-662-44777-2_65

Representative families: A unified tradeoff-based approach

Hadas Shachnai, Meirav Zehavi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

23 Scopus citations

Abstract

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 language	English
Title of host publication	Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings
Publisher	Springer Verlag
Pages	786-797
Number of pages	12
ISBN (Print)	9783662447765
DOIs	https://doi.org/10.1007/978-3-662-44777-2_65
State	Published - 1 Jan 2014
Externally published	Yes
Event	22nd Annual European Symposium on Algorithms, ESA 2014 - Wroclaw, Poland Duration: 8 Sep 2014 → 10 Sep 2014

Publication series

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

Conference

Conference	22nd Annual European Symposium on Algorithms, ESA 2014
Country/Territory	Poland
City	Wroclaw
Period	8/09/14 → 10/09/14

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-662-44777-2_65

Cite this

Shachnai, H., & Zehavi, M. (2014). Representative families: A unified tradeoff-based approach. In Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings (pp. 786-797). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8737 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-662-44777-2_65

@inproceedings{0ec7a4f500ad4d4b8428d50aecc12a3c,

title = "Representative families: A unified tradeoff-based approach",

abstract = "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.",

author = "Hadas Shachnai and Meirav Zehavi",

year = "2014",

month = jan,

day = "1",

doi = "10.1007/978-3-662-44777-2_65",

language = "English",

isbn = "9783662447765",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "786--797",

booktitle = "Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings",

address = "Germany",

note = "22nd Annual European Symposium on Algorithms, ESA 2014 ; Conference date: 08-09-2014 Through 10-09-2014",

}

Shachnai, H & Zehavi, M 2014, Representative families: A unified tradeoff-based approach. in Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8737 LNCS, Springer Verlag, pp. 786-797, 22nd Annual European Symposium on Algorithms, ESA 2014, Wroclaw, Poland, 8/09/14. https://doi.org/10.1007/978-3-662-44777-2_65

Representative families: A unified tradeoff-based approach. / Shachnai, Hadas; Zehavi, Meirav.
Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings. Springer Verlag, 2014. p. 786-797 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8737 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Representative families

T2 - 22nd Annual European Symposium on Algorithms, ESA 2014

AU - Shachnai, Hadas

AU - Zehavi, Meirav

PY - 2014/1/1

Y1 - 2014/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=84958526789&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-44777-2_65

DO - 10.1007/978-3-662-44777-2_65

M3 - Conference contribution

AN - SCOPUS:84958526789

SN - 9783662447765

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 786

EP - 797

BT - Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings

PB - Springer Verlag

Y2 - 8 September 2014 through 10 September 2014

ER -

Representative families: A unified tradeoff-based approach

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this