#### Filter Results:

#### Publication Year

1996

2010

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Anita Amberg, Wolfgang Domschke, Stefan Voo
- 1996

In this paper a survey on existing algorithms for the capacitated minimum spanning tree problem (CMST) is given. The algorithms are classiied providing some insights into their fundamental principles. Reporting the literature, comparisons of the solution quality are given. As one result of the exploration it is observed that heuristic procedures for the… (More)

The aim of the present study was to evaluate the expression of hedgehog (Hh) signaling molecules and the chemotactic activity of Sonic hedgehog (Shh) in monocytes from control (CTR) and diabetic patients with or without coronary artery disease (CAD). Previously several studies demonstrated that exogenous administration of Shh can induce angiogenesis and… (More)

- Andreas Fink, Gabriele Schneidereit, Stefan Voo
- 1998

We consider the problem of designing ring networks for metropolitan area networks. Given a number of nodes representing locations that may be connected, the task is to construct a ring network by selecting a node subset and corresponding direct links. Any two nodes on the ring are enabled to communicate with each other so that the network provider gains a… (More)

- Andreas Fink, Stefan Voo
- 1998

Continuous ow-shop scheduling problems circumscribe an important class of sequenc-ing problems in the eld of production planning. The problem considered here is to nd a permutation of jobs to be processed sequentially on a number of machines under the restriction that the processing of each job has to be continuous with respect to the objective of… (More)

- Stefan Voo
- 1999

In this paper we study the geodetic number and the Steiner number of a graph. Given a graph G the geodetic number is the minimum cardinality of a subset S of nodes from G such that every node of G is contained in a shortest path between some pair of nodes in S. Correspondingly, the Steiner number is the minimum cardinality of a subset S of nodes from G such… (More)

- ‹
- 1
- ›