English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Fine-Grained Completeness for Optimization in P

MPS-Authors
/persons/resource/persons44182

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

/persons/resource/persons263580

Cassis,  Alejandro
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons242908

Fischer,  Nick
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)

LIPIcs-APPROX9.pdf
(Publisher version), 835KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Bringmann, K., Cassis, A., Fischer, N., & Künnemann, M. (2021). Fine-Grained Completeness for Optimization in P. In M. Wootters, & L. Sanità (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (pp. 1-22). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.APPROX/RANDOM.2021.9.


Cite as: https://hdl.handle.net/21.11116/0000-0009-B411-8
Abstract
There is no abstract available