DYNAMIC-PROGRAMMING AND GRAPH OPTIMIZATION PROBLEMS

被引：1
|
作者：
HU, TC
MORGENTHALER, JD
机构：
[1] Department of Computer Science, Engineering University of California, San Diego La Jolla
来源：
COMPUTERS & MATHEMATICS WITH APPLICATIONS | 1994年 / 27卷 / 9-10期
关键词：
D O I：
10.1016/0898-1221(94)90123-6
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Several classes of graph optimization problems, which can be solved using dynamic programming, are known to have more efficient tailor-made algorithms. This paper discusses four such classes and the underlying constraints on their subproblem interrelationships that yield these efficient algorithms. These classes are also extended to handle more general cost functions.
引用
收藏
页码：53 / 58
页数：6
相关论文
共 50 条
12345