Pages that link to "Item:Q3330991"

The following pages link to A quick method for finding shortest pairs of disjoint paths (Q3330991):

Displaying 50 items.

• A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) (← links)
• Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths (Q328701) (← links)
• Finding paths with minimum shared edges (Q386426) (← links)
• On the complexity of the edge-disjoint min-min problem in planar digraphs (Q428855) (← links)
• Fractional routing using pairs of failure-disjoint paths (Q496701) (← links)
• Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
• The complexity of finding two disjoint paths with min-max objective function (Q584275) (← links)
• A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks (Q819071) (← links)
• Finding disjoint paths with related path costs (Q857785) (← links)
• Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks (Q877588) (← links)
• An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs (Q959515) (← links)
• An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs (Q975758) (← links)
• Algorithms for connected set cover problem and fault-tolerant connected set cover problem (Q1006053) (← links)
• Finding non-dominated bicriteria shortest pairs of disjoint simple paths (Q1025230) (← links)
• Acyclic k-connected subgraphs for distributed alternate routing in communications networks (Q1115406) (← links)
• Algorithms for multicommodity flows in planar graphs (Q1119160) (← links)
• Directed Steiner problems with connectivity constraints (Q1315992) (← links)
• Two algorithms for minimum 2-connected \(r\)-hop dominating set (Q1675775) (← links)
• A double oracle approach to minmax regret optimization problems with interval data (Q1683128) (← links)
• Fast approximation of matroid packing and covering (Q1730564) (← links)
• Bidirectional edges problem. I: A simple algorithm (Q1908265) (← links)
• Single-commodity network design with random edge capacities (Q1926752) (← links)
• Linear time algorithms for two disjoint paths problems on directed acyclic graphs (Q1929240) (← links)
• A shortest cycle for each vertex of a graph (Q1944201) (← links)
• Min-cost-flow preserving bijection between subgraphs and orientations (Q2111782) (← links)
• Polynomial time algorithms for tracking path problems (Q2144269) (← links)
• Solving the selective multi-category parallel-servicing problem (Q2341388) (← links)
• Finding disjoint paths in networks with star shared risk link groups (Q2344758) (← links)
• Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints (Q2354302) (← links)
• On finding Min-Min disjoint paths (Q2375950) (← links)
• Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations (Q2676343) (← links)
• Failure disjoint paths (Q2861540) (← links)
• Load balancing optimization of capacitated networks with path protection (Q2861563) (← links)
• Path Problems in Complex Networks (Q2913787) (← links)
• Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs (Q3004683) (← links)
• Multicriteria movement synchronization scheduling problems and algorithms (Q3165912) (← links)
• Identifying Backbones in Three-Dimensional Discrete Fracture Networks: A Bipartite Graph-Based Approach (Q4627440) (← links)
• Length-constrained cycle partition with an application to UAV routing* (Q5058406) (← links)
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms (Q5308327) (← links)
• A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks (Q5357510) (← links)
• (Q5743515) (← links)
• On Analysis of Traffic Flow Demultiplexing Effectiveness (Q5866325) (← links)
• Resilience of communication networks to random failures and disasters: An optimization perspective (Q6066054) (← links)
• Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort (Q6066060) (← links)
• A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690) (← links)
• Finding shortest and dissimilar paths (Q6071084) (← links)
• Factorization and exact evaluation of the source-terminal diameter-constrained reliability (Q6496357) (← links)
• Efficient heuristics for determining node-disjoint path pairs visiting specified nodes (Q6496358) (← links)
• Toward fast calculation of communication paths for resilient routing (Q6496360) (← links)
• Computing disjoint paths with length constraints (Q6550560) (← links)