de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

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

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons79160

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
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: http://hdl.handle.net/11858/00-001M-0000-0029-2ACE-0
Abstract
There is no abstract available