Please use this identifier to cite or link to this item:
http://hdl.handle.net/2067/38071
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Clementi, A. E. F. | en |
dc.contributor.author | Crescenzi, P. | en |
dc.contributor.author | Penna, P. | en |
dc.contributor.author | Rossi, G. | en |
dc.contributor.author | Vocca, Paola | en |
dc.date.accessioned | 2020-10-20T23:00:51Z | - |
dc.date.available | 2020-10-20T23:00:51Z | - |
dc.date.issued | 2001 | en |
dc.identifier.uri | http://hdl.handle.net/2067/38071 | - |
dc.title | On the complexity of computing minimum energy consuption bradcast subgraphs | en |
dc.type | conferenceObject | en |
dc.identifier.doi | 10.1007/3-540-44693-1_11 | en |
dc.relation.isbn | 3540416951 | en |
dc.relation.journal | STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings | en |
dc.relation.firstpage | 121 | en |
dc.relation.lastpage | 131 | en |
dc.relation.numberofpages | 11 | en |
dc.relation.conferencename | STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings | en |
dc.relation.volume | 2010 | en |
dc.relation.issue | 2010 | en |
dc.type.miur | 273 | en |
dc.publisher.name | Springer-Verlag | en |
dc.publisher.country | NLD | en |
item.fulltext | No Fulltext | - |
item.openairetype | conferenceObject | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | none | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
Appears in Collections: | D1. Contributo in Atti di convegno |
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