V. S. Anil Kumar, Sunil Arya, and H. Ramesh. Hardness of set cover with intersection 1. In Automata, Languages and Programming, pages 624--635, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Connected Sensor Cover: Self-Organization of Sensor Networks.. - Gupta, Das, Gu (2003) (4 citations) (Correct)
....Coverage Problem: Given a sensor network and a query over the network, the connected sensor coverage problem is to find the smallest connected sensor cover. The connected sensor coverage problem is NP hard as the less general problem of covering points using line segments is known to be NP hard [16]. Constructing a minimum connected sensor cover for a query in a sensor network enables the query to be computed by involving a minimum number of sensors without compromising on the accuracy of the query result. 2.3 A Note on Sensing Regions The sensing region associated with a sensor signifies ....
....the Art Gallery and the related problems with our connected sensor coverage problem is that the Art Gallery and related problems require an optimal placement of observers, while our problem deals with an optimal selection of already placed sensors. From that perspective, the geometric variations [16, 17, 5] of the classic set cover problem are more related to our problem. However, none of the geometric set cover variations addressed in the literature deal with the notion of connectivity. For the disk cover problem [5] there is a polynomial algorithm that delivers a constant factor approximation, ....
V. S. A. Kumar, S. Arya, and H. Ramesh. Hardness of set cover with intersection 1. In Automata, Languages and Programming, 2000.
Guarding Lines and 2-Link Polygons is APX-Hard - Brodén, Hammar, Nilsson (2001) (1 citation) (Correct)
....the complexity question for 2 link polygons. In doing so we analyze a related problem called the minimum line covering problem which is interesting in its own right. We give a succinct reduction from MAX 2SAT proving that this problem is APX hard. A similar result was claimed by Kumar et al. [7] but our construction gives an explicit lower bound on the approximation ratio. From the minimum line covering problem there is a straightforward gap preserving reduction to the minimum guard covering problem, a fact that Mitchell and Konen independently observed. 2 Problem Formulation Before ....
V. S. A. Kumar, S. Arya, and H. Ramesh. Hardness of set cover with intersection 1. In Proc. 27th International Colloquium, ICALP, pages 624635, 2000.
Algorithms for Distributed and Mobile Sensing - Isler (2004) Self-citation (Kumar) (Correct)
No context found.
V. S. Anil Kumar, Sunil Arya, and H. Ramesh. Hardness of set cover with intersection 1. In Automata, Languages and Programming, pages 624--635, 2000.
Covering Points with Lines - Langerman, Morin (Correct)
No context found.
V. S. Anil Kumar, Sunil Arya, and H. Ramesh. Hardness of set cover with intersection 1. In Proc. 27th Int. Coll. Automata, Languages and Programming, pages 624-635, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC