English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

SETH-Based Lower Bounds for Subset Sum and Bicriteria Path

MPS-Authors
/persons/resource/persons44182

Bringmann,  Karl
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

Abboud, A., Bringmann, K., Hermelin, D., & Shabtay, D. (2019). SETH-Based Lower Bounds for Subset Sum and Bicriteria Path. In T. M. Chan (Ed.), Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 41-57). Philadelphia, PA: SIAM. doi:10.1137/1.9781611975482.3.


Cite as: http://hdl.handle.net/21.11116/0000-0002-9E12-8
Abstract
There is no abstract available