The proceedings contain 17 papers. The topics discussed include: computing optimal hypertree decompositions; constructing the wavelet tree and wavelet matrix in distributed memory; FixCon: a generic solver for fixed-cardinality subgraph problems; engineering kernelization for maximum cut; shared-memory branch-and-reduce for multiterminal cuts; group centrality maximization for large-scale graphs; approximating vertex cover using structural rounding; a multi-criteria approximation algorithm for influence maximization with probabilistic guarantees; and puzzling grid embeddings.
Blelloch, Guy; Finocchi, Irene (Eds.). (2020). 2020 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). ACM (Association for Computing Machinery). Isbn: 978-1-61197-600-7. Doi: 10.1137/1.9781611976007.
2020 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX)
Irene Finocchi
2020
Abstract
The proceedings contain 17 papers. The topics discussed include: computing optimal hypertree decompositions; constructing the wavelet tree and wavelet matrix in distributed memory; FixCon: a generic solver for fixed-cardinality subgraph problems; engineering kernelization for maximum cut; shared-memory branch-and-reduce for multiterminal cuts; group centrality maximization for large-scale graphs; approximating vertex cover using structural rounding; a multi-criteria approximation algorithm for influence maximization with probabilistic guarantees; and puzzling grid embeddings.
| File | Dimensione | Formato | |
|---|---|---|---|
|
alenexProc.pdf
Solo gestori archivio
Tipologia:
Versione dell'editore
Licenza:
DRM (Digital rights management) non definiti
Dimensione
75.2 MB
Formato
Adobe PDF
|
75.2 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
