Faster Exponential-Time Approximation Algorithms Using Approximate Monotone 
Local Search

Esmer, Bariş Can; Kulik, Ariel; Marx, Dániel; Neuen, Daniel; Sharma, Roohani

doi:10.4230/LIPIcs.ESA.2022.50

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search

MPS-Authors

/persons/resource/persons255161

Sharma, Roohani
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-ESA-2022-50.pdf
(Publisher version), 929KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Esmer, B. C., Kulik, A., Marx, D., Neuen, D., & Sharma, R. (2022). Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. In S. Chechik, G. Navarro, E. Rotenberg, & G. Herman (Eds.), 30th Annual European Symposium on Algorithms (pp. 1-19). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ESA.2022.50.

Cite as: https://hdl.handle.net/21.11116/0000-000C-1DA2-D

Abstract

There is no abstract available