Finding cheapest deadline paths

DOI10.1007/978-3-030-89543-3_40MaRDI QIDQ2695315zbMATH OpenOpenAlexFDO

Authors Wei Ding

Publication date 30 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-89543-3_40

zbMATH Keywords

deadline pathFPTASgraph traverse

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• Cheapest paths in dynamic networks
• Computational Science - ICCS 2004
• Finding minimum cost to time ratio cycles with small integral transit times
• Minimizing Weighted Completion Times with Deadlines
• Determining time-dependent minimum cost paths under several objectives
• Path-reduced costs for eliminating arcs in routing and scheduling

Cites work

• A dual algorithm for the constrained shortest path problem
• A note on two problems in connexion with graphs
• A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology
• A simple efficient approximation scheme for the restricted shortest path problem
• Algorithms for finding paths with multiple constraints
• An improved FPTAS for Restricted Shortest Path.
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Approximation Schemes for the Restricted Shortest Path Problem
• Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes
• Efficient QoS routing.
• Finding Multi-Constrained Multiple Shortest Paths
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimum diameter cost-constrained Steiner trees
• Multiconstrained QoS Routing: A Norm Approach
• Near linear time \((1 + \epsilon)\)-approximation for restricted shortest paths in undirected graphs

This page was built for publication: Finding cheapest deadline paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695315)