English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

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;

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

Bringmann, K., Künnemann, M., & Węgrzycki, K. (2019). Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max. In M. Charikar, & E. Cohen (Eds.), STOC '19 (pp. 943-954). New York, NY: ACM. doi:10.1145/3313276.3316373.


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