z-logo
open-access-imgOpen Access
Shortest Connection Networks on Triangular Grids
Author(s) -
Jie Mei
Publication year - 2017
Language(s) - Uncategorized
Resource type - Dissertations/theses
DOI - 10.23860/thesis-mei-jie-2017
Subject(s) - steiner tree problem , shortest path problem , grid , connection (principal bundle) , euclidean geometry , heuristic , euclidean shortest path , mathematics , combinatorics , set (abstract data type) , computer science , mathematical optimization , k shortest path routing , graph , geometry , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom