Approximation and hardness results for the maximum edges in transitive closure problem

Anna Maria Adamaszek, Guillaume Blin, Alexandru Popa

Publikation: Bidrag til bog/antologi/rapport › Bidrag til bog/antologi › Forskning › peer review

5 Citationer (Scopus)

Originalsprog	Engelsk
Titel	Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers
Antal sider	11
Publikationsdato	2014
Sider	13-23
DOI	https://doi.org/10.1007/978-3-319-19315-1_2
Status	Udgivet - 2014
Udgivet eksternt	Ja

Adgang til dokumentet

Approximation and hardness results for the maximum edges in transitive closure problem. / Adamaszek, Anna Maria; Blin, Guillaume; Popa, Alexandru.
Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers. 2014. s. 13-23.

Publikation: Bidrag til bog/antologi/rapport › Bidrag til bog/antologi › Forskning › peer review

@inbook{234beb65badc448681fb8607cc5c3aeb,

title = "Approximation and hardness results for the maximum edges in transitive closure problem",

author = "Adamaszek, {Anna Maria} and Guillaume Blin and Alexandru Popa",

year = "2014",

doi = "10.1007/978-3-319-19315-1_2",

language = "English",

pages = "13--23",

booktitle = "Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers",

}

TY - CHAP

T1 - Approximation and hardness results for the maximum edges in transitive closure problem

AU - Adamaszek, Anna Maria

AU - Blin, Guillaume

AU - Popa, Alexandru

PY - 2014

Y1 - 2014

U2 - 10.1007/978-3-319-19315-1_2

DO - 10.1007/978-3-319-19315-1_2

M3 - Book chapter

SP - 13

EP - 23

BT - Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers

ER -