3678 search results - page 499 / 736 » On the Stable Paths Problem |
116
click to vote
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
143
click to vote
CSR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
148
click to vote
IPCO
2007
15 years 6 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
136
click to vote
SODA
1990
ACM
15 years 5 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
127
click to vote
ALGORITHMICA
2002
15 years 4 months ago
2002
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...