Sciweavers

ISAAC
2001
Springer
123views Algorithms» more  ISAAC 2001»
14 years 4 months ago
Labeling Subway Lines
Abstract. Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to convey their meaning. In this paper we focus on a pr...
Maria Angeles Garrido, Claudia Iturriaga, Alberto ...
ISAAC
2001
Springer
116views Algorithms» more  ISAAC 2001»
14 years 4 months ago
On-Line Multicasting in All-Optical Networks
We consider the routing for a special type of communication requests, called a multicast, consisting of a fixed source and a multiset of destinations in a wavelength division mult...
Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno
ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
14 years 4 months ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...
ISAAC
2001
Springer
102views Algorithms» more  ISAAC 2001»
14 years 4 months ago
Multiprocess Time Queue
Andrej Brodnik, Johan Karlsson
ISAAC
2001
Springer
125views Algorithms» more  ISAAC 2001»
14 years 4 months ago
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)
Evolutionary trees describing the relationship for a set of species are central in evolutionary biology, and quantifying differences between evolutionary trees is an important tas...
Gerth Stølting Brodal, Rolf Fagerberg, Chri...
ISAAC
2001
Springer
104views Algorithms» more  ISAAC 2001»
14 years 4 months ago
Algorithms for Pattern Involvement in Permutations
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
Michael H. Albert, Robert E. L. Aldred, Mike D. At...
ICCS
2001
Springer
14 years 4 months ago
Parallel High-Dimensional Integration: Quasi-Monte Carlo versus Adaptive Cubature Rules
Abstract Parallel algorithms for the approximation of a multi-dimensional integral over an hyper-rectangular region are discussed. Algorithms based on quasi-Monte Carlo techniques ...
Rudolf Schürer
ICALP
2001
Springer
14 years 4 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
EUROPAR
2001
Springer
14 years 4 months ago
Optimal Many-to-One Routing on the Mesh with Constant Queues
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
Andrea Pietracaprina, Geppino Pucci