25 search results - page 2 / 5 » Algorithms for Three Versions of the Shortest Common Superst... |
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
ENTCS
2007
13 years 5 months ago
2007
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...
JDA
2006
13 years 5 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
IPCO
2004
13 years 6 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...