Approximation and Hardness Results for the Maximum Edges in Transitive Closure 
Problem

Adamaszek, Anna; Blin, Guillaume; Popa, Alexandru

doi:10.1007/978-3-319-19315-1_2

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem

MPS-Authors

/persons/resource/persons79160

Adamaszek, Anna
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Adamaszek, A., Blin, G., & Popa, A. (2015). Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem. In J. Kratchovíl, M. Miller, & D. Froncek (Eds.), Combinatorial Algorithms (pp. 13-23). Berlin: Springer. doi:10.1007/978-3-319-19315-1_2.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0029-2ACE-0

Abstract

There is no abstract available