Results 1  10
of
305,298
Variants of the MinSum LinkDisjoint Paths Problem
"... A survivable connection usually requires computing linkdisjoint primary and backup paths. Finding a minsum pair of linkdisjoint paths whose total cost is minimized can be solved in polynomial time. However, adding extra requirements may render the problem NPcomplete. In this paper, we study diff ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
A survivable connection usually requires computing linkdisjoint primary and backup paths. Finding a minsum pair of linkdisjoint paths whose total cost is minimized can be solved in polynomial time. However, adding extra requirements may render the problem NPcomplete. In this paper, we study
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
Split Multipath Routing with Maximally Disjoint Paths in Ad Hoc Networks
 In Proc. Int. IEEE Conf. on Comm., 2001
"... Abstract – In recent years, routing has been the most focused area in ad hoc networks research. Ondemand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed ondemand routing protocols however ..."
Abstract

Cited by 421 (4 self)
 Add to MetaCart
however, build and rely on single route for each data session. Whenever there is a link disconnection on the active route, the routing protocol must perform a route recovery process. In QoS routing for wired networks, multiple path routing is popularly used. Multiple routes are however, constructed using
On the Complexity and Approximation of the MinSum and MinMax Disjoint Paths Problems
"... Abstract. Given a graph G =(V,E)andk sourcesink pairs {(s1,t1),..., (sk,tk)} with each si,ti ∈ V, the MinSum Disjoint Paths problem asks k disjoint paths to connect all the sourcesink pairs with minimized total length, while the MinMax Disjoint Paths problem asks also k disjoint paths to connect ..."
Abstract
 Add to MetaCart
Abstract. Given a graph G =(V,E)andk sourcesink pairs {(s1,t1),..., (sk,tk)} with each si,ti ∈ V, the MinSum Disjoint Paths problem asks k disjoint paths to connect all the sourcesink pairs with minimized total length, while the MinMax Disjoint Paths problem asks also k disjoint paths
FINDING TWO DISJOINT PATHS IN A NETWORK WITH NORMALIZED ¢ ¡MINSUM OBJECTIVE FUNCTION
"... Given a number ¥ with ¦¨§©¥�§� � , a graph ������������� and two nodes � and � in � , we consider the problem of finding two disjoint paths �� � and �� � from � to � such that ����������������������¥��������������������� � with ��������������������� is minimized. The paths may be nodedisjoint or ed ..."
Abstract
 Add to MetaCart
Given a number ¥ with ¦¨§©¥�§� � , a graph ������������� and two nodes � and � in � , we consider the problem of finding two disjoint paths �� � and �� � from � to � such that ����������������������¥��������������������� � with ��������������������� is minimized. The paths may be nodedisjoint
A HighThroughput Path Metric for MultiHop Wireless Routing
, 2003
"... This paper presents the expected transmission count metric (ETX), which finds highthroughput paths on multihop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The E ..."
Abstract

Cited by 1078 (5 self)
 Add to MetaCart
This paper presents the expected transmission count metric (ETX), which finds highthroughput paths on multihop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination
Probabilistic Roadmaps for Path Planning in HighDimensional Configuration Spaces
 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION
, 1996
"... A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collisionfree configurations and whose edg ..."
Abstract

Cited by 1276 (124 self)
 Add to MetaCart
edges correspond to feasible paths between these configurations. These paths are computed using a simple and fast local planner. In the query phase, any given start and goal configurations of the robot are connected to two nodes of the roadmap; the roadmap is then searched for a path joining these two
DSR: The Dynamic Source Routing Protocol for MultiHop Wireless Ad Hoc Networks
 In Ad Hoc Networking, edited by Charles E. Perkins, Chapter 5
, 2001
"... The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multihop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely selforganizing and selfconfiguring, without the need for any existing network infrastruc ..."
Abstract

Cited by 743 (8 self)
 Add to MetaCart
The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multihop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely selforganizing and selfconfiguring, without the need for any existing network
Efficiently computing static single assignment form and the control dependence graph
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1991
"... In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single ass ..."
Abstract

Cited by 997 (8 self)
 Add to MetaCart
In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 565 (0 self)
 Add to MetaCart
problem, in which all shortestpath computations are performed on networks with all weights nonnegative. In particular, this
Results 1  10
of
305,298