SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

IWCTS 2012 - 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science

Volumn , Issue , 2012, Pages 33-38

On optimal preprocessing for contraction hierarchies

(1) Milosavljević, Nikola a

a UNIVERSITY OF STUTTGART (Germany)

Author keywords

APX hardness; contraction hierarchies; planar graphs; shortest paths

Indexed keywords

APX-HARDNESS; GRAPH CLASS; PLANAR GRAPH; PRE-PROCESSING ALGORITHMS; QUERY ALGORITHMS; ROAD NETWORK; SHORTEST PATH; SHORTEST PATH QUERIES;

ALGORITHMS; GRAPHIC METHODS; HARDNESS;

GRAPH THEORY;

EID: 84875196628 PISSN: None EISSN: None Source Type: Conference Proceeding
DOI: 10.1145/2442942.2442949 Document Type: Conference Paper

Times cited : (19)

References (7)

1
- 79960022546
- VC-dimension and shortest path algorithms
- Berlin, Heidelberg, Springer-Verlag
- I. Abraham, D. Delling, A. Fiat, A. V. Goldberg, and R. F. Werneck. VC-dimension and shortest path algorithms. In Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I, ICALP'11, pages 690-699, Berlin, Heidelberg, 2011. Springer-Verlag.
- (2011) Proceedings of the 38th International Colloquim Conference on Automata, Languages and Programming - Volume Part I, ICALP'11 , pp. 690-699
- Abraham, I.¹ Delling, D.² Fiat, A.³ Goldberg, A.V.⁴ Werneck, R.F.⁵

2
- 77951688930
- Highway dimension, shortest paths, and provably efficient algorithms
- M. Charikar, editor, SIAM
- I. Abraham, A. Fiat, A. V. Goldberg, and R. F. Werneck. Highway dimension, shortest paths, and provably efficient algorithms. In M. Charikar, editor, SODA, pages 782-793. SIAM, 2010.
- (2010) SODA, Pages , pp. 782-793
- Abraham, I.¹ Fiat, A.² Goldberg, A.V.³ Werneck, R.F.⁴

3
- 77953769083
- Preprocessing speed-up techniques is hard
- Berlin, Heidelberg, Springer-Verlag
- R. Bauer, T. Columbus, B. Katz, M. Krug, and D. Wagner. Preprocessing speed-up techniques is hard. In Proceedings of the 7th international conference on Algorithms and Complexity, CIAC'10, pages 359-370, Berlin, Heidelberg, 2010. Springer-Verlag.
- (2010) Proceedings of the 7th International Conference on Algorithms and Complexity, CIAC'10 , pp. 359-370
- Bauer, R.¹ Columbus, T.² Katz, B.³ Krug, M.⁴ Wagner, D.⁵

4
- 29844440416
- On the hardness of approximating minimum vertex cover
- I. Dinur and S. Safra. On the hardness of approximating minimum vertex cover. Annals of Mathematics, 162(1):439-485, 2005. (Pubitemid 43034608)
- (2005) Annals of Mathematics , vol.162 , Issue.1 , pp. 439-485
- Dinur, I.¹ Safra, S.²

5
- 74049161349
- Studying (non-planar) road networks through an algorithmic lens
- New York, NY, USA, ACM
- D. Eppstein and M. T. Goodrich. Studying (non-planar) road networks through an algorithmic lens. In Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems, GIS '08, pages 16:1-16:10, New York, NY, USA, 2008. ACM.
- (2008) Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS '08
- Eppstein, D.¹ Goodrich, M.T.²

6
- 84864363720
- Exact routing in large road networks using contraction hierarchies
- R. Geisberger, P. Sanders, D. Schultes, and C. Vetter. Exact routing in large road networks using contraction hierarchies. Transportation Science, 2012.
- (2012) Transportation Science
- Geisberger, R.¹ Sanders, P.² Schultes, D.³ Vetter, C.⁴

7
- 0000843755
- Generalized nested dissection
- R. J. Lipton, D. J. Rose, and R. E. Tarjan. Generalized nested dissection. SIAM J. Numer. Anal., 16(2):346-358, 1979.
- (1979) SIAM J. Numer. Anal. , vol.16 , Issue.2 , pp. 346-358
- Lipton, R.J.¹ Rose, D.J.² Tarjan, R.E.³

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