Finding cheapest deadline paths

DOI10.1007/978-3-030-89543-3_40OpenAlexW3209490361MaRDI QIDQ2695315

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

FPTASdeadline pathgraph traverse

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Efficient QoS routing.
• A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology
• An improved FPTAS for Restricted Shortest Path.
• Minimum diameter cost-constrained Steiner trees
• Finding Multi-Constrained Multiple Shortest Paths
• Algorithms for finding paths with multiple constraints
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• A dual algorithm for the constrained shortest path problem
• Approximation Schemes for the Restricted Shortest Path Problem
• Multiconstrained QoS Routing: A Norm Approach
• Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes
• A simple efficient approximation scheme for the restricted shortest path problem

This page was built for publication: Finding cheapest deadline paths