#### Filter Results:

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We introduce a variation of the scheduling with precedence constraints problem that has applications to molecular folding and production management. We are given a bipartite graph H = (B, S). Vertices in B are thought of as goods or services that must be bought to produce items in S that are to be sold. An edge from j ∈ S to i ∈ B indicates that the… (More)

We consider a special case of the generalized minimum spanning tree problem (GMST) and the generalized travelling salesman problem (GTSP) where we are given a set of points inside the integer grid (in Euclidean plane) where each gride cell is 1 × 1. In the MST version of the problem, the goal is to find a minimum tree that contains exactly one point from… (More)

- ‹
- 1
- ›