IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v25y2013i2d10.1007_s10878-012-9475-x.html
   My bibliography  Save this article

Coverage with k-transmitters in the presence of obstacles

Author

Listed:
  • Brad Ballinger

    (Humboldt State University)

  • Nadia Benbernou

    (Massachusetts Institute of Technology)

  • Prosenjit Bose

    (Carleton University)

  • Mirela Damian

    (Villanova University)

  • Erik D. Demaine

    (Massachusetts Institute of Technology)

  • Vida Dujmović

    (Carleton University)

  • Robin Flatland

    (Siena College)

  • Ferran Hurtado

    (Universitat Politècnica de Catalunya)

  • John Iacono

    (Polytechnic Institute of New York University)

  • Anna Lubiw

    (University of Waterloo)

  • Pat Morin

    (Carleton University)

  • Vera Sacristán

    (Universitat Politècnica de Catalunya)

  • Diane Souvaine

    (Tufts University)

  • Ryuhei Uehara

    (Japan Advanced Institute of Science and Technology)

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.

Suggested Citation

  • Brad Ballinger & Nadia Benbernou & Prosenjit Bose & Mirela Damian & Erik D. Demaine & Vida Dujmović & Robin Flatland & Ferran Hurtado & John Iacono & Anna Lubiw & Pat Morin & Vera Sacristán & Diane So, 2013. "Coverage with k-transmitters in the presence of obstacles," Journal of Combinatorial Optimization, Springer, vol. 25(2), pages 208-233, February.
    • Handle: RePEc:spr:jcomop:v:25:y:2013:i:2:d:10.1007_s10878-012-9475-x
    DOI: 10.1007/s10878-012-9475-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-012-9475-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-012-9475-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:25:y:2013:i:2:d:10.1007_s10878-012-9475-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.