An improved FPTAS for Restricted Shortest Path.
From MaRDI portal
Publication:1853085
Recommendations
- A simple efficient approximation scheme for the restricted shortest path problem
- Fast approximation algorithms for routing problems with hop-wise constraints
- Near linear time \((1 + \epsilon)\)-approximation for restricted shortest paths in undirected graphs
- Approximation Schemes for the Restricted Shortest Path Problem
- Approximating the restricted 1-center in graphs
Cites work
Cited in
(37)- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- Improving the solution complexity of the scheduling problem with deadlines: a general technique
- Bi-criteria path problem with minimum length and maximum survival probability
- Approximation scheme for restricted discrete gate sizing targeting delay minimization
- The subdivision-constrained routing requests problem
- Multi-criteria approximation schemes for the resource constrained shortest path problem
- Near linear time \((1 + \epsilon)\)-approximation for restricted shortest paths in undirected graphs
- Maximum probabilistic all-or-nothing paths
- A general approximation method for bicriteria minimization problems
- Approximation schemes for a class of subset selection problems
- One-exact approximate Pareto sets
- Improved approximation algorithms for the combination problem of parallel machine scheduling and path
- The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem
- A simple efficient approximation scheme for the restricted shortest path problem
- Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
- Polynomial time approximation schemes for the constrained minimum spanning tree problem
- Single machine scheduling with two competing agents and equal job processing times
- Approximating the restricted 1-center in graphs
- The capacity expansion path problem in networks
- On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
- Simple paths with exact and forbidden lengths
- Improved LP-rounding approximations for the \(k\)-disjoint restricted shortest paths problem
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem
- A note on approximating the min-max vertex disjoint paths on directed acyclic graphs
- Approximating the Restricted 1-Center in Graphs
- Fast approximation algorithms for routing problems with hop-wise constraints
- Efficiently computing succinct trade-off curves
- Improved FPT Algorithms for Rectilinear k-Links Spanning Path
- A simulated annealing for multi-criteria network path problems
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
- Approximation algorithms for constructing some required structures in digraphs
- Finding cheapest deadline paths
- The \(k\)-centrum shortest path problem
- An improved FPTAS for mobile agent routing with time constraints
- Approximation Schemes for the Restricted Shortest Path Problem
This page was built for publication: An improved FPTAS for Restricted Shortest Path.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853085)
