Sciweavers

3678 search results - page 39 / 736
» On the Stable Paths Problem
Sort
View
160
Voted
MOR
2000
162views more  MOR 2000»
15 years 3 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
137
Voted
SODA
2007
ACM
131views Algorithms» more  SODA 2007»
15 years 5 months ago
On the K-simple shortest paths problem in weighted directed graphs
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
Liam Roditty
117
Voted
NETWORKS
2010
15 years 2 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
154
Voted
NETWORKS
2008
15 years 3 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
ATAL
2009
Springer
15 years 10 months ago
Stable multi-project scheduling of airport ground handling services by heterogeneous agents
This paper addresses decentralized multi-project scheduling under uncertainty. The problem instance we study is the scheduling of airport ground handling services, where aircraft ...
Xiaoyu Mao, Nico Roos, Alfons H. Salden