SCOPUS 정보 검색 플랫폼

Volumn 1851, Issue , 2000, Pages 314-328

Improved greedy algorithms for constructing sparse geometric spanners

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

CONNECTED GRAPH; CONSTANT DEGREE; D-DIMENSIONAL SPACES; EUCLIDEAN GRAPH; GEOMETRIC SPANNER; GREEDY ALGORITHMS; SUBGRAPHS; TIME ALGORITHMS;

GRAPH THEORY;

EID: 84956858316 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/3-540-44985-X Document Type: Conference Paper

Times cited : (12)

References (11)

1
- 0001674433
- Euclidean spanners: Short, thin, and lanky
- S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. Euclidean spanners: short, thin, and lanky. In Proc. ACM STOC'95, pages 489-498, 1995.
- (1995) Proc. ACM STOC'95 , pp. 489-498
- Arya, S.¹ Das, G.² Mount, D.M.³ Salowe, J.S.⁴ Smid, M.⁵

2
- 0029239056
- A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields
- P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM, 42:67-90, 1995.
- (1995) J. ACM , vol.42 , pp. 67-90
- Callahan, P.B.¹ Kosaraju, S.R.²

3
- 0011228674
- Lower bounds for computing geometric spanners and approximate shortest paths
- D. Z. Chen, G. Das, and M. Smid. Lower bounds for computing geometric spanners and approximate shortest paths. In Proc. CCCG'96, pages 155-160, 1996.
- (1996) Proc. CCCG'96 , pp. 155-160
- Chen, D.Z.¹ Das, G.² Smid, M.³

4
- 0031496743
- A fast algorithm for constructing sparse Euclidean spanners
- G. Das and G. Narasimhan. A fast algorithm for constructing sparse Euclidean spanners. Internat. J. Comput. Geom. Appl., 7(4):297-315, 1997.
- (1997) Internat. J. Comput. Geom. Appl , vol.7 , Issue.4 , pp. 297-315
- Das, G.¹ Narasimhan, G.²

5
- 0001837015
- Classes of graphs which approximate the complete Euclidean graph
- J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete Comput. Geom., 7:13-28, 1992.
- (1992) Discretecomput. Geom , vol.7 , pp. 13-28
- Keil, J.M.¹ Gutwin, C.A.²

6
- 84956857309
- D. Mount. Personal communication, 1998.
- (1998) Personal Communication
- Mount, D.¹

7
- 0003487647
- Springer-Verlag, New York, NY
- F.P. Preparata and M.I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.
- (1985) Computational Geometry: An Introduction
- Preparata, F.P.¹ Shamos, M.I.²

8
- 84956858440
- Improved approximation schemes for traveling sales-man tours
- S. B. Rao and W. D. Smith. Improved approximation schemes for traveling sales-man tours. In Proc. ACM STOC'98, 1998.
- (1998) Proc. ACM STOC'98
- Rao, S.B.¹ Smith, W.D.²

9
- 0011248703
- Construction of multidimensional spanner graphs with applications to minimum spanning trees
- J. S. Salowe. Construction of multidimensional spanner graphs with applications to minimum spanning trees. In Proc. ACM SoCG'91, pages 256-261, 1991.
- (1991) Proc. ACM Socg'91 , pp. 256-261
- Salowe, J.S.¹

10
- 0000778521
- Undirected single-source shortest path with positive integer weights in linear time
- M. Thorup. Undirected single-source shortest path with positive integer weights in linear time. J. ACM, 46(3):362-394, 1999.
- (1999) J. ACM , vol.46 , Issue.3 , pp. 362-394
- Thorup, M.¹

11
- 51249175990
- A sparse graph almost as good as the complete graph on points in K dimensions
- P. M. Vaidya. A sparse graph almost as good as the complete graph on points in K dimensions. Discrete Comput. Geom., 6:369-381, 1991.
- (1991) Discrete Comput. Geom , vol.6 , pp. 369-381
- Vaidya, P.M.¹

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