The Checkpoint Problem

Hajiaghayi, MohammadTaghi; Khandekar, Rohit; Kortsarz, Guy; Mestre, Julian

doi:10.1007/978-3-642-15369-3_17

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

The Checkpoint Problem

MPS-Authors

/persons/resource/persons44769

Khandekar, Rohit
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44828

Kortsarz, Guy
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45030

Mestre, Julian
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

Hajiaghayi, M., Khandekar, R., Kortsarz, G., & Mestre, J. (2010). The Checkpoint Problem. In M. Serna, R. Shaltiel, K. Jansen, & J. Rolim (Eds.), Approximation, Randomization, and Combinatorial Optimization (pp. 219-231). Berlin: Springer. doi:10.1007/978-3-642-15369-3_17.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-16FA-9

Abstract

There is no abstract available