193 search results - page 27 / 39 » A Lower Bound for the Shortest Path Problem |
120
Voted
DBPL
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
WDAG
2007
Springer
15 years 5 months ago
2007
Springer
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
109
Voted
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
93
Voted
KI
2001
Springer
15 years 4 months ago
2001
Springer
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
113
click to vote
SPAA
2006
ACM
15 years 5 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...