An improved FPTAS for Restricted Shortest Path.
From MaRDI portal
Publication:1853085
DOI10.1016/S0020-0190(02)00205-3zbMATH Open1051.68152OpenAlexW2061701207MaRDI QIDQ1853085FDOQ1853085
Authors: Lisa Zhang, Funda Ergün, Rakesh Kumar Sinha 
Publication date: 21 January 2003
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00205-3
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
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Cites Work
Cited In (35)
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem
- The subdivision-constrained routing requests problem
- Improving the solution complexity of the scheduling problem with deadlines: A general technique
- An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem
- Approximating the Restricted 1-Center in Graphs
- A simple efficient approximation scheme for the restricted shortest path problem
- Single machine scheduling with two competing agents and equal job processing times
- Improved FPT Algorithms for Rectilinear k-Links Spanning Path
- Simple paths with exact and forbidden lengths
- On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
- Maximum probabilistic all-or-nothing paths
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Polynomial time approximation schemes for the constrained minimum spanning tree problem
- The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks
- A simulated annealing for multi-criteria network path problems
- Approximation schemes for a class of subset selection problems
- One-exact approximate Pareto sets
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
- An improved FPTAS for mobile agent routing with time constraints
- Fast approximation algorithms for routing problems with hop-wise constraints
- Approximation scheme for restricted discrete gate sizing targeting delay minimization
- The capacity expansion path problem in networks
- Approximation Schemes for the Restricted Shortest Path Problem
- Improved approximation algorithms for the combination problem of parallel machine scheduling and path
- Finding cheapest deadline paths
- A general approximation method for bicriteria minimization problems
- A note on approximating the min-max vertex disjoint paths on directed acyclic graphs
- Multi-criteria approximation schemes for the resource constrained shortest path problem
- Approximation algorithms for constructing some required structures in digraphs
- Approximating the restricted 1-center in graphs
- Efficiently computing succinct trade-off curves
- The \(k\)-centrum shortest path problem
- Bi-criteria path problem with minimum length and maximum survival probability
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)
