Efficient approximation algorithms for computing k disjoint constrained shortest paths
DOI10.1007/S10878-015-9934-2zbMATH Open1354.90153OpenAlexW2472937526MaRDI QIDQ328701FDOQ328701
Authors: Longkun Guo 
Publication date: 20 October 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9934-2
Recommendations
- Improved LP-rounding approximations for the \(k\)-disjoint restricted shortest paths problem
- Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints
- Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints
- The Directed Disjoint Shortest Paths Problem
- Algorithms and Computation
\(k\)-disjoint constrained shortest pathbifactor approximation algorithmcycle cancellationflow theoryLP rounding
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Combinatorial optimization. Theory and algorithms.
- A simple efficient approximation scheme for the restricted shortest path problem
- The complexity of finding two disjoint paths with min-max objective function
- Title not available (Why is that?)
- Disjoint paths in a network
- A quick method for finding shortest pairs of disjoint paths
- On finding Min-Min disjoint paths
- On the complexity of the edge-disjoint min-min problem in planar digraphs
- Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints
- Finding disjoint paths with related path costs
Cited In (7)
- On the complexity of algorithms for detecting \(k\)-length negative cost cycles
- Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints
- Improved LP-rounding approximations for the \(k\)-disjoint restricted shortest paths problem
- An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
- A heuristic algorithm for multi-constrained shortest link-disjoint paths
- Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints
- A novel approach to subgraph selection with multiple weights on arcs
This page was built for publication: Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328701)
