Suchergebnisse - Approximate algorithm of shortest-path calculations

Identifying critical weak points of power-gas integrated energy system based on complex network theory von Zhang, Chenwei, Wang, Ying, Zheng, Tao, Wang, Chen, Zhang, Kaifeng

“… •An approximate algorithm of shortest-paths calculations (AA-SPC) is proposed.•Six attack strategies and two vulnerability assessment indicators are developed …”
Volltext

To Meet or Not to Meet: Finding the Shortest Paths in Road Networks von Weihuang Huang, Yikai Zhang, Zechao Shang, Yu, Jeffrey Xu

“… Finding the shortest path in road networks becomes one of important issues in location based services (LBS …”
Volltext

Lower bound sets for biobjective shortest path problems von Machuca, Enrique, Mandow, Lawrence

“… ), could further improve performance. This article describes a lower bound set calculation method for biobjective shortest path problems …”
Volltext

Advances in Surveying Topographically Complex Ecosystems with UAVs: Manta Ray Foraging Algorithms von Yang, Shijie, Yuan, Jiateng, Chen, Zhibo, Zhang, Hanchao, Cui, Xiaohui

“… ) algorithm to enhance efficiency and energy utilization in forest ecosystem monitoring. Traditionally reliant on costly manual patrols, this method leverages UAVs and ground-based sensors for data collection …”
Volltext

Edge-Based Heuristics for Optimizing Shortcut-Augmented Topologies for HPC Interconnects von Fuad, Kazi Ahmed Asif, Zeng, Kai, Chen, Lizhong

“… Interconnection network topology is critical for the overall performance of HPC systems. While many regular and irregular topologies have been proposed in the …”
Volltext

面向大规模道路网的最短路径近似算法 von 张志然, 刘纪平, 仇阿根, 钱新林, 张福浩

“… P208; 节点重要性对大规模道路网下最短路径的计算有着重要影响.本文提出了顾及节点重要性的最短路径估计方法, 该方法基于Critic方法与复杂网络理论评价节点的重要性, 结合 …”
Volltext

Simulation-Based Electric Vehicle Sustainable Routing with Time-Dependent Stochastic Information von Li, Xinran, Kan, Haoxuan, Hua, Xuedong, Wang, Wei

“… The shortest path problem is solved by an approximate dynamic programming algorithm to improve calculation efficiency in complex networks …”
Volltext

Complex network theory-based optimization for enhancing resilience of large-scale multi-energy System von Zhang, Chenwei, Wang, Ying, Zheng, Tao, Zhang, Kaifeng

“… supply equipment as weighted factors. To accelerate the calculation of shortest paths in large-scale MES, an approximate algorithm for shortest paths …”
Volltext

Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon von Burago, D., Grigoriev, D., Slissenko, A.

“… We consider two three-dimensional situations when a polytime algorithm for approximating a shortest path can be constructed …”
Volltext

A fast estimation of shortest path distance for power-law network predominant cloud service von Jin Liu, Chunming Rong, Ganseng Zhao

“… , biological networks and so forth. The short response time, the less space cost and the high accuracy are three critical evaluation metrics in the approximate calculation of the shortest path …”
Volltext

A Simple Boosting Framework for Transshipment von Zuzic, Goran

“… Specifically, the recent near-optimal \((1+\varepsilon)\)-approximate single-source shortest path algorithms in the parallel and distributed settings crucially solve transshipment as a central step of their approach …”
Volltext

Identifying Real Transport Networks in Rural Areas on the Basis of Cadastral Data von Janus, Jaroslaw, Bozek, Piotr

“… It is based on the use of cadastral databases for the purpose of building a model of the area in question as well as graph algorithms identifying the shortest paths in the graph …”
Volltext

About one of the methods for solving problems in QoS routing von Abramkina, Olga A., Shuvalov, Vyacheslav P.

“… The MCP problem used the shortest path with respect to a single edge weighting function as an approximate solution to MCP …”
Volltext

A Fast Algorithm to Find All-Pairs Shortest Paths in Complex Networks von Peng, Wei, Hu, Xiaofeng, Zhao, Feng, Su, Jinshu

“… Although many exact and approximate algorithms have been proposed, it is still a time-consuming task to calculate shortest paths for large-scale networks with tremendous volume of data available in recent years …”
Volltext

An ADD-based algorithm for shortest path back-tracing of large graphs von Bahar, R.I., Hachtel, G.D., Pardo, A., Poncino, M., Somenzi, F.

“… for approximate finite state machine traversal. ADD-based procedures for single-source and all-pairs shortest path weight calculation have appeared to be very effective for the manipulation of large graphs …”
Volltext

A New Geometric Algorithm for Steiner Minimal Tree Problem by referring Visualization Experiment von Yang, ZongXiao, Hao, JieYu, Gao, YanPing, Ye, Kun

“… A new algorithm, geometry-experiment algorithm (GEA), is constructed to solve system shortest path using the nature of Delaunay diagram and basic philosophy of geo …”
Volltext

A rapid globe-wide shortest route planning algorithm based on two-layer oceanic shortcut network considering great circle distance von Huang, Yi, Xiao, Yuminghao, Wang, Hongdong, Yi, Hong

“… Then, A* graph-search is applied on the proposed OSN to derive a shortest path between given starting and end points, which is applicable in the dispatching system for vessels …”
Volltext

Complex network theory-based optimization for enhancing resilience of large-scale multi-energy System11The short version of the paper was presented at CUE2023. This paper is a substantial extension of the short version of the conference paper von Zhang, Chenwei, Wang, Ying, Zheng, Tao, Zhang, Kaifeng

“… supply equipment as weighted factors. To accelerate the calculation of shortest paths in large-scale MES, an approximate algorithm for shortest paths …”
Volltext

Geometry-Experiment Algorithm for Steiner Minimal Tree Problem von Yang, Zong-Xiao, Jia, Xiao-Yao, Hao, Jie-Yu, Gao, Yan-Ping

“… Two algorithms, geometry algorithm and geometry-experiment algorithm (GEA), are constructed to solve system shortest path using the property of Delaunay diagram …”
Volltext

Sublinear geometric algorithms von CHAZELLE, Bernard, DING LIU, MAGEN, Avner

Volltext