Dual-Mode Greedy Algorithms Can Save Energy

Geissmann, Barbara; Leucci, Stefano; Liu, Chih-Hung; Penna, Paolo; Proietti, Guido

doi:10.4230/LIPIcs.ISAAC.2019.64

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Dual-Mode Greedy Algorithms Can Save Energy

MPS-Authors

/persons/resource/persons243589

Leucci, Stefano
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://drops.dagstuhl.de/opus/volltexte/2019/11560/
(Publisher version)

https://creativecommons.org/licenses/by/3.0/legalcode
(Copyright transfer agreement)

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

Geissmann, B., Leucci, S., Liu, C.-H., Penna, P., & Proietti, G. (2019). Dual-Mode Greedy Algorithms Can Save Energy. In P. Lu, & G. Zhang (Eds.), 30th International Symposium on Algorithms and Computation. Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ISAAC.2019.64.

Cite as: https://hdl.handle.net/21.11116/0000-0007-DBBA-1

Abstract

There is no abstract available