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.

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.
978-1-61197-600-7
File in questo prodotto:
File Dimensione Formato  
alenexProc.pdf

Solo gestori archivio

Tipologia: Versione dell'editore
Licenza: DRM non definito
Dimensione 75.2 MB
Formato Adobe PDF
75.2 MB Adobe PDF   Visualizza/Apri
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11385/193033
Citazioni
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact