English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

A Structural Investigation of the Approximability of Polynomial-Time Problems

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-ICALP-2022-30.pdf
(Publisher version), 789KB

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

Bringmann, K., Cassis, A., Fischer, N., & Künnemann, M. (2022). A Structural Investigation of the Approximability of Polynomial-Time Problems. In M. Bojańczyk, E. Merelli, & D. P. Woodruff (Eds.), 49th EATCS International Conference on Automata, Languages, and Programming (pp. 1-20). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2022.30.


Cite as: https://hdl.handle.net/21.11116/0000-000B-15B5-1
Abstract
There is no abstract available