Sciweavers

NETWORKS
1998
13 years 11 months ago
Fault-tolerant graphs for tori
Toshinori Yamada, Shuichi Ueno
NETWORKS
1998
13 years 11 months ago
A polynomial algorithm for the p-centdian problem on a tree
Arie Tamir, Dionisio Pérez-Brito, Jos&eacut...
NETWORKS
1998
13 years 11 months ago
How to test a tree
Andrew B. Kahng, Gabriel Robins, Elizabeth A. Walk...
NETWORKS
1998
13 years 11 months ago
Project scheduling with multiple modes: A comparison of exact algorithms
This paper is devoted to a comparison of all available branch-and-bound algorithms that can be applied to solve resource-constrained project scheduling problems with multiple exec...
Sönke Hartmann, Andreas Drexl
NETWORKS
1998
13 years 11 months ago
Process network synthesis: Problem definition
Ferenc Friedler, L. T. Fan, Balázs Imreh
NETWORKS
1998
13 years 11 months ago
Approximating Steiner trees in graphs with restricted weights
Magnús M. Halldórsson, Shuichi Ueno,...