An Omega(n^3) Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures
Konferenzbeitrag › Konferenzpaper
› 2020
Zitation
Konferenzbeitrag Full Paper
Bauernöppel, Frank; Maheshwari, Anil; Sack, Jörg-Rüdiger: An Omega(n^3) Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures. In: LATIN 2020: Theoretical Informatics. LATIN 2021. Lecture Notes in Computer Science, vol 12118. Hg. von Kohayakawa Y., Miyazawa F.K., University of São Paulo, Brazil. Cham: Springer Nature 2020, S. 235-246.