Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
61.703 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
  • Ponències/Comunicacions de congressos
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
  • Ponències/Comunicacions de congressos
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Coverage with k-transmitters in the presence of obstacles

Thumbnail
View/Open
coverage with k-transmitters.pdf (521,6Kb) (Restricted access)   Request copy 

Què és aquest botó?

Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:

  • Disposem del correu electrònic de l'autor
  • El document té una mida inferior a 20 Mb
  • Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
 
10.1007/978-3-642-17461-2
 
  View Usage Statistics
  LA Referencia / Recolecta stats
Cita com:
hdl:2117/11067

Show full item record
Uehara, R.
Souvaine, D.
Sacristán Adinolfi, VeraMés informacióMés informació
Morin, P.
Lubiw, A.
Iacono, J.
Ballinger, B.
Benbernou, N.
Bose, P.
Damian, M.
Demaine, E. D.
Dujmovic, Vida
Flatland, R.
Hurtado Díaz, Fernando AlfredoMés informacióMés informació
Document typeConference report
Defense date2010
PublisherSpringer Verlag
Rights accessRestricted access - publisher's policy
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
For a fixed integer k ≥ 0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k “walls”, represented as line segments in the plane. We develop lower and upper bounds for the number of k-transmitters that are necessary and sufficient to cover a given collection of line segments, polygonal chains and polygons.
CitationBallinger, B. [et al.]. Coverage with k-transmitters in the presence of obstacles. A: Annual International Conference on Combinatorial Optimization and Applications. "4th Annual International Conference on Combinatorial Optimization and Applications". Hawaii: Springer Verlag, 2010, p. 1-15. 
URIhttp://hdl.handle.net/2117/11067
DOI10.1007/978-3-642-17461-2
ISBN3-642-17457-4
Publisher versionhttp://www.springerlink.com/content/g7116wr21w383265/fulltext.pdf
Collections
  • DCCG - Grup de recerca en geometria computacional, combinatoria i discreta - Ponències/Comunicacions de congressos [68]
  • Departament de Matemàtiques - Ponències/Comunicacions de congressos [1.057]
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
coverage with k-transmitters.pdfBlocked521,6KbPDFRestricted access

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina