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 条
  • [21] Finding Two Edge-Disjoint Paths with Length Constraints
    Cai, Leizhen
    Ye, Junjie
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2016, 2016, 9941 : 62 - 73
  • [22] An efficient approximate algorithm for finding paths with two additive constraints
    Feng, G
    Douligeris, C
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2002, E85B (06) : 1143 - 1151
  • [23] Bipedalism, obstetrics, and the evolution of constraints.
    Grabowski, Mark W.
    AMERICAN JOURNAL OF PHYSICAL ANTHROPOLOGY, 2012, 147 : 154 - 154
  • [24] VIEWPOINT ON NEIGHBORHOOD TRAFFIC CONSTRAINTS.
    Williams, Roy D.
    Public Works, 1980, III (03): : 76 - 77
  • [25] External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs
    Babenko, Maxim
    Kolesnichenko, Ignat
    SOFSEM 2018: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2018, 10706 : 295 - 304
  • [26] Diet, brains, and evolutionary constraints.
    Tattersall, Ian
    AMERICAN JOURNAL OF PHYSICAL ANTHROPOLOGY, 2011, 144 : 290 - 290
  • [27] Greedy Algorithms for Finding Entanglement Swap Paths in Quantum Networks
    Pandey, Anoop Kumar
    Srivastava, Anubhav
    Handoo, Shuhul
    Tamma, Bheemarjuna Reddy
    Rao, M. V. Panduranga
    PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND NETWORKING, ICDCN 2023, 2023, : 237 - 244
  • [28] Greedy Algorithms for Finding Entanglement Swap Paths in Quantum Networks
    Pandey, Anoop Kumar
    Srivastava, Anubhav
    Handoo, Shuhul
    Tamma, Bheemarjuna Reddy
    Rao, M.V. Panduranga
    ACM International Conference Proceeding Series, 2023, : 237 - 244
  • [29] EFFICIENT ALGORITHMS FOR FINDING THE K BEST PATHS THROUGH A TRELLIS
    CASTANON, DA
    IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 1990, 26 (02) : 405 - 409
  • [30] Finding the k shortest paths by ripple-spreading algorithms
    Hu, Xiao-Bing
    Zhang, Chi
    Zhang, Gong-Peng
    Zhang, Ming-Kong
    Li, Hang
    Leeson, Mark S.
    Liao, Jian-Qin
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2020, 87
12345