Sciweavers

206 search results - page 4 / 42
» Three Hoppy path problems and ternary paths
Sort
View
STACS
2010
Springer
14 years 2 months ago
On Iterated Dominance, Matrix Elimination, and Matched Paths
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
Felix Brandt, Felix A. Fischer, Markus Holzer
NETWORKS
2008
13 years 7 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
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
13 years 11 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
FOCS
1991
IEEE
13 years 11 months ago
On the Exponent of the All Pairs Shortest Path Problem
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
Noga Alon, Zvi Galil, Oded Margalit
IEAAIE
2005
Springer
14 years 1 months ago
Discovering Learning Paths on a Domain Ontology Using Natural Language Interaction
The present work investigates the problem of determining a learning path inside a suitable domain ontology. The proposed approach enables the user of a web learning application to ...
Roberto Pirrone, Massimo Cossentino, Giovanni Pila...