#### Filter Results:

#### Publication Year

1997

2002

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Two new path problems in graphs are studied: MINRANGE, i.e., find a path from a vertex s to a vertex 1 with the smallest possible range of arc lengths. and MINRATIO, i.e., find such a path for which the ratio of the largest to the smallest arc length is minimum. Several bicriterion extensions of these problems are also considered.

- ‹
- 1
- ›