English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max

MPS-Authors
/persons/resource/persons44182

Bringmann,  Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44857

Künnemann,  Marvin
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

Bringmann, K., Künnemann, M., & Węgrzycki, K. (in press). Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max. In STOC'19. New York, NY: ACM.


Cite as: http://hdl.handle.net/21.11116/0000-0002-FC7A-A
Abstract
There is no abstract available