Finding a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property and Applications.
A. Aggarwal; B. Schieber; T. Tokuyama
Discrete & computational geometry (1994)
- Volume: 12, Issue: 3, page 263-280
- ISSN: 0179-5376; 1432-0444/e
Access Full Article
topHow to cite
topAggarwal, A., Schieber, B., and Tokuyama, T.. "Finding a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property and Applications.." Discrete & computational geometry 12.3 (1994): 263-280. <http://eudml.org/doc/131331>.
@article{Aggarwal1994,
author = {Aggarwal, A., Schieber, B., Tokuyama, T.},
journal = {Discrete & computational geometry},
keywords = {directed acyclic graph; time complexity},
number = {3},
pages = {263-280},
title = {Finding a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property and Applications.},
url = {http://eudml.org/doc/131331},
volume = {12},
year = {1994},
}
TY - JOUR
AU - Aggarwal, A.
AU - Schieber, B.
AU - Tokuyama, T.
TI - Finding a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property and Applications.
JO - Discrete & computational geometry
PY - 1994
VL - 12
IS - 3
SP - 263
EP - 280
KW - directed acyclic graph; time complexity
UR - http://eudml.org/doc/131331
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.