To access the full text documents, please follow this link: http://hdl.handle.net/2117/13767
dc.contributor | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II |
---|---|
dc.contributor | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
dc.contributor.author | Abellanas, Manuel |
dc.contributor.author | Bajuelos, Antonio L. |
dc.contributor.author | Pereira de Matos, Inés |
dc.date | 2011-08-16 |
dc.identifier.citation | ABELLANAS, M.; Bajuelos, A.; de Matos, I. Minimizing the range for k-covered paths on sensor networks. "The Computer journal (paper)", 16 Agost 2011, p. 1-13. |
dc.identifier.citation | 0010-4620 |
dc.identifier.citation | 10.1093/comjnl/bxr076 |
dc.identifier.uri | http://hdl.handle.net/2117/13767 |
dc.language.iso | eng |
dc.publisher | Wiley Heyden |
dc.relation | http://comjnl.oxfordjournals.org/content/early/2011/08/16/comjnl.bxr076.abstract |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights | info:eu-repo/semantics/openAccess |
dc.rights | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria |
dc.subject | Geometry |
dc.subject | Geometria algebraica |
dc.subject | 51 GEOMETRY |
dc.title | Minimizing the range for k-covered paths on sensor networks |
dc.type | info:eu-repo/semantics/publishedVersion |
dc.type | info:eu-repo/semantics/article |
dc.description.abstract | |
dc.description.abstract |