𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Voronoi diagrams with barriers and the shortest diagonal problem

✍ Scribed by Andrzej Lingas

Book ID
118323801
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
751 KB
Volume
32
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Inapproximability results for the invers
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
✍ Andreas Bley πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 304 KB

## Abstract We study the complexity of two inverse shortest paths (ISP) problems with integer arc lengths and the requirement for uniquely determined shortest paths. Given a collection of paths in a directed graph __D__ = (__V__, __A__), the task is to find positive integer arc lengths such that th

A dynamic programming algorithm for the
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
✍ Ioachim, Irina; GοΏ½linas, Sylvie; Soumis, FranοΏ½ois; Desrosiers, Jacques πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 154 KB πŸ‘ 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w