首页> 外文OA文献 >Finding disjoint paths with different path costs: Complexity and algorithms

【2h】

Finding disjoint paths with different path costs: Complexity and algorithms

机译：寻找具有不同路径成本的不相交路径：复杂性和算法

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
S. Thomas Mccormick; David Simchi-levi;
展开▼
作者单位

展开▼
年度 1992
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph [J] . Chih-Chiang Yu, Chien-Hsin Lin, Biing-Feng Wang Journal of computer and system sciences . 2010,第8期

机译：改进的算法，用于在平面图中找到长度有界的两个顶点不相交路径，并在有向无环图中找到minmax k个顶点不相交路径
2. On the complexity of and algorithms for finding the shortest path with a disjoint counterpart [J] . Dahai Xu, Yang Chen, Yizhi Xiong, IEEE/ACM Transactions on Networking . 2006,第1期

机译：寻找不相交对应物的最短路径的复杂度和算法
3. Effective algorithms for finding optimum pairs of link-disjoint paths in α + 1 path protection [J] . Ming-Lee Gan, Soung-Yue Liew Telecommunication systems: Modeling, Analysis, Design and Management . 2013,第2期

机译：在α+1路径保护中找到最佳链对不相交路径对的有效算法
4. OFDP: A Distributed Algorithm for Finding Disjoint Paths with Minimum Total Energy Cost in Wireless Sensor Networks [C] . Kejia Zhang, Hong Gao, Guisheng Yin, International conference on wireless algorithms, systems, and applications . 2014

机译：OFDP：一种分布式算法，用于在无线传感器网络中以最小的总能源成本查找不相交的路径
5. k-Pairwise disjoint shortest paths: Algorithms and complexity. [D] . Serena, Frank David. 2002

机译：k对不相交的最短路径：算法和复杂性。
6. New algorithms for maximum disjoint paths based on tree-likeness [O] . Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase -1

机译：基于树状图的最大不相交路径的新算法
7. Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph [O] . Yu, Chih-Chiang 2012

机译：改进的算法，用于在平面图中找到长度有界的两个顶点不相交路径，并在有向无环图中找到minmax k个顶点不相交路径
8. Average Network Flow Problem: Shortest Path and Minimum Cost Flow Formulations, Algorithms, Heuristics, and Complexity. [R] . Jordan, J. D. 2012

机译：平均网络流量问题：最短路径和最小成本流量公式，算法，启发式和复杂性。

Finding disjoint paths with different path costs: Complexity and algorithms

著录项

引文网络

相似文献

相关主题

期刊订阅