A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
An Experimental Study of Weighted k-Link Shortest Path Algorithms
[chapter]

*
Springer Tracts in Advanced Robotics
*

We give

doi:10.1007/978-3-540-68405-3_12
fatcat:soehlpen45fkpokrhuzpg5py4a
*an**algorithm*that generates*paths**of**weighted*length at most (1 + ) times the*weight**of*a minimum-cost*k*-*link**path*, for any fixed > 0, while using at most 2k − 1*links*. ... We consider the problem*of*computing a minimum-*weight*polygonal*path*between two points in a*weighted*polygonal subdivision, subject to the constraint that the*path*have few segments (*links*). ... The first*experimental**studies**of*the*weighted*region problem ( [11, 13] ) were based on implementations*of*such*algorithms*. ...##
###
Modified Floyd Warshall Algorithm for Cache Management in Information Centric Network

2020
*
International Journal of Intelligent Engineering and Systems
*

In

doi:10.22266/ijies2020.0229.14
fatcat:73pqvtmb6bcnfcy33h6yaulegm
*experimental*section, the proposed*shortest**path*estimation method showed better performance in light*of*latency,*link*load and cache hit ratio as compared to the existing approaches: Floyd Warshall ... In order to address this problem, a new*shortest**path*estimation*algorithm*(Modified Floyd Warshall*Algorithm*(MFWA)) was developed to identify the*shortest**path*in each subnet for retrieving the cache ... From the*experimental**study*, the proposed*shortest**path*estimation*algorithm*showed better result in cache management by means*of*cache hit ratio,*link*load, and latency. ...##
###
Determining link weight system under various objectives for OSPF networks using a Lagrangian relaxation-based approach

2005
*
IEEE Transactions on Network and Service Management
*

*An*important traffic engineering problem for OSPF networks is the determination

*of*optimal

*link*

*weights*. Certainly, this depends on the traffic engineering objective. ... In this paper, we consider different objectives and discuss how they impact the determination

*of*the

*link*

*weights*and different performance measures. ... Wang et al [27] have shown that any given set

*of*optimal routes can be converted to

*shortest*

*paths*with respect to a set

*of*positive

*link*

*weights*and

*link*

*weights*can be calculated by solving the dual ...

##
###
Anonymizing Shortest Paths on Social Network Graphs
[chapter]

2011
*
Lecture Notes in Computer Science
*

In particular, to protect the

doi:10.1007/978-3-642-20039-7_13
fatcat:5anckl24k5ajnk3i2m2txhhkqq
*weight*privacy*of*the*shortest**path*between two vertices on a*weighted*graph, we present a new concept called*k*-anonymous*path*privacy. ... Greedy-based modification*algorithms*and*experimental*results showing the feasibility and characteristics*of*the proposed approach are presented. ...*K*-Single*Path*Anonymization*Algorithm*(KSP) Input: W,*weighted*adjacency matrix*of*a given graph G, The source and destination vertices for which the*shortest**path*is to be anonymized,*K*, number*of**shortest*...##
###
k-Link Shortest Paths in Weighted Subdivisions
[chapter]

2005
*
Lecture Notes in Computer Science
*

We

doi:10.1007/11534273_29
fatcat:37sv2l6qzzaynlwioviugvvah4
*study*the*shortest**path*problem in*weighted*polygonal subdivisions*of*the plane, with the additional constraint*of**an*upper bound,*k*, on the number*of**links*(segments) in the*path*. ...*of**an*optimal*k*-*link**path*, for any fixed > 0. ... In this paper we*study*the*k*-*link**shortest**path*problem in*weighted*regions, in which we place*an*upper bound,*k*, on the number*of**links*(edges) in the polygonal*path*, while minimizing the*weighted*length ...##
###
Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem

2019
*
Mathematical Problems in Engineering
*

*An*efficient

*algorithm*based on Lagrangian dual relaxation is designed to solve constrained robust

*shortest*

*path*problem.

*An*extension problem that considers multiple constraints is discussed. ... Numerical

*studies*indicate that the proposed

*algorithm*is efficient in terms

*of*obtaining the close-to-optimal solutions within reasonable computational times. ... Acknowledgments This

*study*is sponsored in part by National Science Foundation

*of*China under grant No. 51508280 and by Startup Foundation

*of*Nanjing Forestry University under grant No. ...

##
###
A Multi-path Nonoverlapping Routing Algorithm for Deterministic Networking

2022
*
Highlights in Science, Engineering and Technology
*

Because it is different from existing routing

doi:10.54097/hset.v1i.461
fatcat:ihypl7ezivhrzkkdhjetr32r5e
*algorithms*on the Internet, it is*an*important subject to*study*routing*algorithms*that meet requirements*of*DetNet. ... Based on routing characteristics*of*DetNet, we*studied*a multi-routing*algorithm*- Bhandari*algorithm*. ... the operation*of*directly setting all*links**of*the first*shortest**path*as negative*weights*. ...##
###
Optimizedk-shortest-paths algorithm for facility restoration

1994
*
Software, Practice & Experience
*

This paper presents

doi:10.1002/spe.4380240904
fatcat:2sgx5wsn6jfwxase7lj5viqpim
*experimental**studies**of*several well-known shortestpaths*algorithms*adapted to the task*of*finding the*k*-successively-*shortest**link*-disjoint replacement*paths*for restoration in a telecommunications ... Network resoration*k*-*shortest*-*paths*to the task*of*finding the*k*-successively-*shortest**link*-disjoint replacement*paths*for restoration in a telecommunications network with n nodes. ... INTRODUCTION This paper presents*an**experimental**study**of*several*shortest*-*paths**algorithms*adapted failures have made network restoration*an*area*of*urgent interest, and several distributed real-time ...##
###
Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation

1998
*
IEEE Transactions on Knowledge and Data Engineering
*

In this paper, we also present

doi:10.1109/69.687976
fatcat:sjtf25sjv5fndbb2qwm4wlfm6m
*an*in-depth*experimental*evaluation*of*HEPV based on both synthetic and real GIS networks. ... While*path*precomputation (*path*view) would provide*an*efficient*path*query response, it raises three problems which must be addressed: 1) precomputed*paths*exceed the current computer main memory capacity ... The*path**weight*PW ij is the sum*of*the*link**weights**of*all*links*on the*path*, i.e., PW ij = p m = − ∑ 1 1 LW*k**k*q q+1 . ...##
###
Applying Electromagnetic Field Theory Concepts to Clustering with Constraints
[chapter]

2009
*
Lecture Notes in Computer Science
*

A clustering

doi:10.1007/978-3-642-04180-8_49
fatcat:f2ipyjbzs5gxndondnb5k44ljy
*algorithm*is then applied on the adjusted graph, using*k*-distinct*shortest**paths*as the distance measure. ... For the distance metric to be used by the clustering*algorithm*, we propose*k*simple-anddistinct*shortest**paths*, described in section 4.3. ... For vector data, we use the same*k*for the number*of**shortest**paths*since this is the maximum out-*links*number*of**an*edge. ...##
###
Routing with multiple quality-of-services constraints: An approximation perspective

2012
*
Journal of Network and Computer Applications
*

We conduct

doi:10.1016/j.jnca.2011.09.009
fatcat:tr7y2vhntrcv3f4p4h6qxx5rx4
*an*extensive comparison between the*algorithm*presented in this paper and previous best-known*study**experimentally*, our results indicate that EFPTAS can find a*path*with low complexity and preferable ... We first allow the proposed*algorithm*to construct*an*auxiliary graph, through which the QoS parameters on each*of*the finding*path*can be guaranteed not to exceed the given constraints. ... Note that the*shortest**path**of*G p ðV,EÞ and GðV,EÞ is the same, so we could set w p*k*ðeÞ ¼ w*k*ðeÞ Á pþ1 rather than round each*weight**of*the*link*into*an*integer. ...##
###
An Improved SPFA Algorithm for Single-Source Shortest Path Problem Using Forward Star Data Structure

2014
*
International Journal of Managing Information Technology
*

We present

doi:10.5121/ijmit.2014.6402
fatcat:4awn74boi5dqjari6dipwgmfra
*an*improved SPFA*algorithm*for the single source*shortest**path*problem. ... We theoretically analyse the advantage*of*this new*algorithm*and*experimentally*demonstrate that the*algorithm*is efficient. ... compute the*k*-degree*shortest**path*(finding the*shortest**path*between two vertices if their distance is within*k*). ...##
###
AN IMPROVED SPFA ALGORITHM FOR SINGLE SOURCE SHORTEST PATH PROBLEM USING FORWARD STAR DATA STRUCTURE

2014
*
Zenodo
*

We present

doi:10.5281/zenodo.3603564
fatcat:wqlxv3m4srepjklum3s55d3ijq
*an*improved SPFA*algorithm*for the single source*shortest**path*problem. ... We theoretically analyse the advantage*of*this new*algorithm*and*experimentally*demonstrate that the*algorithm*is efficient ... compute the*k*-degree*shortest**path*(finding the*shortest**path*between two vertices if their distance is within*k*). ...##
###
Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes

2020
*
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
*

and the total

doi:10.1609/aaai.v34i01.5441
fatcat:4ilmj3lgvfbtvdgnryhmpa2qkq
*link**weight**of*all*paths*is minimized under the above constraints. ... For the restricted version, we build*an*ILP model and design a fast*algorithm*by using the techniques*of*augmenting*paths*and splitting nodes. ... Acknowledgments The work is supported by the National Natural Science Foundation*of*China, under grants 61972070 and 61802049. ...##
###
Enhancing wavelength converter placement optimization with traffic-engineering-aware shortest-path routing

2004
*
IEICE Electronics Express
*

This paper proposes the combination

doi:10.1587/elex.1.416
fatcat:6ipiohdgirh4rebmicljasmi2a
*of*multiple shortestpaths routing and particle swarm optimization*algorithm*to solve the wavelength converters placement problem. ... Both equal-cost multipath routing and traffic-engineering-aware*shortest*-*path*routing are included in the experiments to examine their effectiveness in reducing the overall blocking probability. ... sum*of*the integer*link**weight*, and the second step minimizes the maximum*link*load among the possible sets*of**shortest**paths*that satisfy the minimum*weight**of*the*shortest**paths*found in the first step ...
« Previous

*Showing results 1 — 15 out of 27,726 results*