An $$\varOmega (n^3)$$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures

Bauernöppel, Frank; Maheshwari, Anil; Sack, Jörg-Rüdiger

doi:10.1007/978-3-030-61792-9_19

LATIN 2020: Theoretical Informatics

2020

DOI: 10.1007/978-3-030-61792-9_19

|View full text |Cite

An $$\varOmega (n^3)$$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures

Frank Bauernöppel

Anil Maheshwari

Jörg-Rüdiger Sack

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

An $$\varOmega (n^3)$$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures

Cited by 1 publication

References 11 publications

An Ω(n) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures

An Ω(n) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures

Contact Info

Product

Resources

About