SCOPUS 정보 검색 플랫폼

Volumn 39, Issue 3, 2008, Pages 209-218

Polynomial-time approximation schemes for piercing and covering with applications in wireless networks

Author keywords

Approximation algorithms; Covering; Discrete piercing; Geometric optimization; Wireless networks

Indexed keywords

EID: 84867956268 PISSN: 09257721 EISSN: None Source Type: Journal
DOI: 10.1016/j.comgeo.2007.01.001 Document Type: Article

Times cited : (10)

References (18)

1
- 0032266683
- Efficient algorithms for geometric optimization
- P.K. Agarwal, and M. Sharir Efficient algorithms for geometric optimization ACM Comput. Surv. 30 1998 412 458
- (1998) ACM Comput. Surv. , vol.30 , pp. 412-458
- Agarwal, P.K.¹ Sharir, M.²

2
- 0028255806
- Approximation algorithms for NP-complete problems on planar graphs
- B.S. Baker Approximation algorithms for NP-complete problems on planar graphs J. ACM 41 1994 153 180
- (1994) J. ACM , vol.41 , pp. 153-180
- Baker, B.S.¹

3
- 25044445636
- Almost optimal set covers in finite VC-dimension
- H. Brönnimann, and M.T. Goodrich Almost optimal set covers in finite VC-dimension Discrete Comput. Geom. 14 1995 463 479
- (1995) Discrete Comput. Geom. , vol.14 , pp. 463-479
- Brönnimann, H.¹ Goodrich, M.T.²

4
- 12144286935
- Selecting forwarding neighbors in wireless ad hoc networks, 2001
- G. Calinescu, I. Mandoiu, P.-J. Wan, and A. Zelikovsky Selecting forwarding neighbors in wireless ad hoc networks, 2001 MONET 9 2 2004 101 111
- (2004) MONET , vol.9 , Issue.2 , pp. 101-111
- Calinescu, G.¹ Mandoiu, I.² Wan, P.-J.³ Zelikovsky, A.⁴

5
- 0038341773
- Polynomial-time approximation schemes for packing and piercing fat objects
- T.M. Chan Polynomial-time approximation schemes for packing and piercing fat objects J. Algorithms 46 2003 178 189
- (2003) J. Algorithms , vol.46 , pp. 178-189
- Chan, T.M.¹

6
- 0000839639
- Unit disk graphs
- B.N. Clark, C.J. Colbourn, and D.S. Johnson Unit disk graphs Discrete Math. 86 1990 165 177
- (1990) Discrete Math. , vol.86 , pp. 165-177
- Clark, B.N.¹ Colbourn, C.J.² Johnson, D.S.³

7
- 33244466054
- Improved approximation algorithms for geometric set cover
- K.L. Clarkson, K. Varadarajan, Improved approximation algorithms for geometric set cover, in: Proc. 21st ACM Symp. on Comput. Geom., 2005, pp. 135-141
- (2005) Proc. 21st ACM Symp. on Comput. Geom. , pp. 135-141
- Clarkson, K.L.¹ Varadarajan, K.²

8
- 0012741558
- Dynamic data structures for fat objects and their applications
- A. Efrat, M.J. Katz, F. Nielsen, and M. Sharir Dynamic data structures for fat objects and their applications Comput. Geom. Theory Appl. 15 2000 215 227
- (2000) Comput. Geom. Theory Appl. , vol.15 , pp. 215-227
- Efrat, A.¹ Katz, M.J.² Nielsen, F.³ Sharir, M.⁴

9
- 84867983625
- Personal communication
- T. Erlebach, Personal communication, 2006
- (2006)
- Erlebach, T.¹

10
- 0021897852
- Approximation schemes for covering and packing problems in image processing and VLSI
- D.S. Hochbaum, and W. Maass Approximation schemes for covering and packing problems in image processing and VLSI J. ACM 32 January 1985 130 136
- (1985) J. ACM , vol.32 , pp. 130-136
- Hochbaum, D.S.¹ Maass, W.²

11
- 0000091588
- NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
- H.B. Hunt III, M.V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz, and R.E. Stearns NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs J. Algorithms 26 2 1998 238 274
- (1998) J. Algorithms , vol.26 , Issue.2 , pp. 238-274
- Hunt Iii, H.B.¹ Marathe, M.V.² Radhakrishnan, V.³ Ravi, S.S.⁴ Rosenkrantz, D.J.⁵ Stearns, R.E.⁶

12
- 49049144709
- The NP-completeness column: An ongoing guide
- D.S. Johnson The NP-completeness column: An ongoing guide J. Algorithms 3 1982 182 195
- (1982) J. Algorithms , vol.3 , pp. 182-195
- Johnson, D.S.¹

13
- 13844276646
- Polynomial time approximation schemes for base station coverage with minimum total radii
- N. Lev-Tov, and D. Peleg Polynomial time approximation schemes for base station coverage with minimum total radii Computer Networks 47 2005 489 501
- (2005) Computer Networks , vol.47 , pp. 489-501
- Lev-Tov, N.¹ Peleg, D.²

14
- 85025286367
- Simple heuristics for unit disk graphs
- M.V. Marathe, H. Breu, H.B. Hunt III, S.S. Ravi, and D.J. Rozenkrantz Simple heuristics for unit disk graphs Networks 25 1995 59 68
- (1995) Networks , vol.25 , pp. 59-68
- Marathe, M.V.¹ Breu, H.² Hunt Iii, H.B.³ Ravi, S.S.⁴ Rozenkrantz, D.J.⁵

15
- 85072872892
- An improved approximation factor for the unit disk covering problem
- S. Narayanappa, P. Vojtěchovský, An improved approximation factor for the unit disk covering problem, in: Proc. 18th Canadian Conf. on Comput. Geom., 2006, pp. 15-18
- (2006) Proc. 18th Canadian Conf. on Comput. Geom. , pp. 15-18
- S. Narayanappa¹

16
- 33745613297
- A PTAS for the minimum dominating set problem in unit disk graphs
- T. Nieberg, J.L. Hurink, A PTAS for the minimum dominating set problem in unit disk graphs, in: Proc. 3rd Workshop on Approximation and Online Algorithms, 2005, pp. 296-306
- (2005) Proc. 3rd Workshop on Approximation and Online Algorithms , pp. 296-306
- Nieberg, T.¹ Hurink, J.L.²

17
- 0030714232
- A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP
- R. Raz, S. Safra, A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP, in: Proc. 29th ACM Symp. on Theory of Computing, 1997, pp. 475-484
- (1997) Proc. 29th ACM Symp. on Theory of Computing , pp. 475-484
- Raz, R.¹ Safra, S.²

18
- 0032306359
- Geometric separator theorems and applications
- W.D. Smith, N.C. Wormald, Geometric separator theorems and applications, in: Proc. 39th IEEE Symp. on Foundations of Computer Science, 1998, pp. 232-243
- (1998) Proc. 39th IEEE Symp. on Foundations of Computer Science , pp. 232-243
- Smith, W.D.¹ Wormald, N.C.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.