Please use this identifier to cite or link to this item:
|Title:||On the complexity of computing minimum energy consuption bradcast subgraphs||Authors:||Clementi, A. E. F.
|Journal:||STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings||Issue Date:||2001||URI:||http://hdl.handle.net/2067/38071||DOI:||10.1007/3-540-44693-1_11|
|Appears in Collections:||D1. Contributo in Atti di convegno|
Show full item record
checked on Oct 16, 2021
All documents in the "Unitus Open Access" community are published as open access.
All documents in the community "Prodotti della Ricerca" are restricted access unless otherwise indicated for specific documents