ALGORITHMS FOR FINDING PATHS WITH MULTIPLE CONSTRAINTS.

被引：0
|
作者：
Jaffe, Jeffrey M.
机构：
来源：
Proceedings - Annual Allerton Conference on Communication, Control, and Computing | 1980年
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
An NP-complete problem with important practical applications is analyzed, and it is shown how to solve it for all practical purposes. An algorithm solves it in polynomial time if the lengths and weights have a small range of values. It is also shown how to approximate the problem if one only had a small amount of time available.
引用
收藏
页码：668 / 676
相关论文
共 50 条
  • [41] Finding multiple induced disjoint paths in general graphs
    Zhang, Kejia
    Gao, Hong
    Li, Jianzhong
    INFORMATION PROCESSING LETTERS, 2011, 111 (20) : 1022 - 1026
  • [42] Finding Multi-Constrained Multiple Shortest Paths
    Feng, Gang
    Korkmaz, Turgay
    IEEE TRANSACTIONS ON COMPUTERS, 2015, 64 (09) : 2559 - 2572
  • [43] ON THE MODELLING OF MATERIALS AND INTERACTIONS WITH THERMOELECTROMECHANICAL CONSTRAINTS.
    Wozniak, Czeslaw
    Bulletin of the Polish Academy of Sciences: Technical Sciences, 1985, 33 (5-6): : 249 - 254
  • [44] DYNAMICS OF RHEONOMIC LAGRANGIAN SYSTEMS WITH CONSTRAINTS.
    Rumyantsev, V.V.
    1600, (48):
  • [45] Theory of constraints. A new management philosophy
    1600, (31):
  • [46] FINDING DISJOINT PATHS WITH DIFFERENT PATH-COSTS - COMPLEXITY AND ALGORITHMS
    LI, CL
    MCCORMICK, ST
    SIMCHILEVI, D
    NETWORKS, 1992, 22 (07) : 653 - 667
  • [47] ALGORITHMS FOR FINDING NONCROSSING PATHS WITH MINIMUM TOTAL LENGTH IN PLANE GRAPHS
    TAKAHASHI, J
    SUZUKI, H
    NISHIZEKI, T
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1995, 78 (04): : 1 - 15
  • [48] 'DEGENERACY' IN PLATES SUBJECTED TO ELASTIC CONSTRAINTS.
    Massalas, C.
    Katsikadelis, J.
    Tzivanidis, G.
    Revue roumaine des sciences techniques. Serie de mecanique appliquee, 1985, 30 (06): : 635 - 639
  • [49] DISCRETE CHEBYSHEV APPROXIMATION WITH LINEAR CONSTRAINTS.
    Brannigan, Michael
    1600, (22):
  • [50] Algorithms for finding noncrossing paths with minimum total length in plane graphs
    Takahashi, Jun-ya
    Suzuki, Hitoshi
    Nishizeki, Takao
    Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi), 1995, 78 (04): : 1 - 15
12345