DSpace JSPUI
DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets
Learn MorePlease use this identifier to cite or link to this item:
http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/999| Title: | NP-hardness of geometric set cover and hitting set with rectangles containing a common point |
| Authors: | Madireddy, R.R. Mudgal, A. |
| Keywords: | Axis-parallel rectangles Geometric set cover Geometric hitting set NP,-hardness Computational geometry |
| Issue Date: | 12-Nov-2018 |
| Abstract: | We prove that both set cover and hitting set problems with points and axis-parallel rectangles are -hard even when (i) all rectangles share a common point and there are only two types of rectangles and for some positive integers a and b. |
| URI: | http://localhost:8080/xmlui/handle/123456789/999 |
| Appears in Collections: | Year-2019 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Full Text.pdf | 1.07 MB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.