IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v41y2021i2d10.1007_s10878-020-00685-y.html
   My bibliography  Save this article

Dominating set of rectangles intersecting a straight line

Author

Listed:
  • Supantha Pandit

    (Dhirubhai Ambani Institute of Information and Communication Technology)

Abstract

The Minimum Dominating Set (MDS) problem is one of the well-studied problems in computer science. It is well-known that this problem is $$\mathsf {NP}$$ NP -hard for simple geometric objects; unit disks, axis-parallel unit squares, and axis-parallel rectangles to name a few. An interesting variation of the MDS problem with rectangles is when there exists a straight line that intersects each of the given rectangles. In the recent past researchers have studied the maximum independent set, minimum hitting set problems on this setting with different geometric objects. We study the MDS problem with axis-parallel rectangles, unit-height rectangles, and unit squares in the plane. These geometric objects are constrained to be intersected by a straight line. For axis-parallel rectangles, we prove that this problem is $$\mathsf {NP}$$ NP -hard. When the objects are axis-parallel unit squares, we present a polynomial time algorithm using dynamic programming. We provide a polynomial time algorithm for unit-height rectangles as well. For unit squares that touch the straight line at a single point from either side of the straight line, we show that there is an $$O(n\log n)$$ O ( n log n ) -time algorithm.

Suggested Citation

  • Supantha Pandit, 2021. "Dominating set of rectangles intersecting a straight line," Journal of Combinatorial Optimization, Springer, vol. 41(2), pages 414-432, February.
    • Handle: RePEc:spr:jcomop:v:41:y:2021:i:2:d:10.1007_s10878-020-00685-y
    DOI: 10.1007/s10878-020-00685-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00685-y
    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-020-00685-y?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.

    References listed on IDEAS

    as
    1. Daniele Catanzaro & Steven Chaplick & Stefan Felsner & Bjarni V. Halldorsson & Magnus M. Halldorsson & Thomas Hixon, 2017. "Max point-tolerance graphs," LIDAM Reprints CORE 2968, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Daniele CATANZARO & Steven CHAPLICK & Stefan FELSNER & Bjarni V. HALLDORSSON & Magnus M. HALLDORSSON & e.a., 2017. "Max point-tolerance graphs," LIDAM Reprints CORE 2774, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Luciano Porretta & Daniele Catanzaro & Bjarni V. Halldórsson & Bernard Fortz, 2019. "A Branch & Price algorithm for the minimum cost clique cover problem in max-point tolerance graphs," 4OR, Springer, vol. 17(1), pages 75-96, March.

    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:41:y:2021:i:2:d:10.1007_s10878-020-00685-y. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.