COCOON
2001
Springer
13 years 8 months ago
2001
Springer
COCOON
2001
Springer
13 years 9 months ago
2001
Springer
abstract appeared in: Proc. of 7th Ann. Int. Computing and Combinatorics Conference, COCOON 2001 (ed. J. Wang), Lecture Notes in Computer Science Vol. 2108, Springer-Verlag, Berlin...
COCOON
2001
Springer
13 years 9 months ago
2001
Springer
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
COCOON
2001
Springer
13 years 9 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
COCOON
2001
Springer
13 years 9 months ago
2001
Springer
COCOON
2001
Springer
13 years 9 months ago
2001
Springer
COCOON
2001
Springer
13 years 9 months ago
2001
Springer
COCOON
2001
Springer
13 years 9 months ago
2001
Springer
We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item ...
COCOON
2001
Springer
13 years 9 months ago
2001
Springer
COCOON
2001
Springer
13 years 9 months ago
2001
Springer
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...