English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

Smart city has been consider the wave of the future and the routerecommendation in networks is a fundamental problem in it. Most existingapproaches for the shortest route problem consider that there is only one kindof cost in networks. However, there always are several kinds of cost innetworks and users prefer to select an optimal route under the globalconsideration of these kinds of cost. In this paper, we study the problem offinding the optimal route in the multi-cost networks. We prove this problem isNP-hard and the existing index techniques cannot be used to this problem. Wepropose a novel partition-based index with contour skyline techniques to findthe optimal route. We propose a vertex-filtering algorithm to facilitate thequery processing. We conduct extensive experiments on six real-life networksand the experimental results show that our method has an improvement inefficiency by an order of magnitude compared to the previous heuristicalgorithms.

An Efficient Index Method for the Optimal Route Query over Multi-Cost Networks