Sciweavers

172 search results - page 8 / 35
» Program generation for the all-pairs shortest path problem
Sort
View
BIBE
2007
IEEE
174views Bioinformatics» more  BIBE 2007»
14 years 1 months ago
Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
WINE
2005
Springer
143views Economy» more  WINE 2005»
14 years 29 days ago
Economic Mechanisms for Shortest Path Cooperative Games with Incomplete Information
Abstract. In this paper we present a cooperative game theoretic interpretation of the shortest path problem. We consider a buying agent who has a budget to go from a specified sou...
T. S. Chandrashekar, Yadati Narahari
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
14 years 28 days ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
ICFEM
2000
Springer
13 years 11 months ago
Formal Treatment of a Family of Fixed-Point Problems on Graphs by CafeOBJ
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
Tetsuo Tamai
IFIP
2004
Springer
14 years 26 days ago
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
Paola Flocchini, Antonio Mesa Enriques, Linda Pagl...