Finding cheapest deadline paths (Q2695315)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Finding cheapest deadline paths	scientific article

Statements

scholarly article

0 references

Finding cheapest deadline paths (English)

0 references

0 references

publication date

30 March 2023

0 references

zbMATH Keywords

deadline path

0 references

graph traverse

0 references

FPTAS

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-89543-3_40

0 references

0 references

A note on two problems in connexion with graphs

0 references

Minimum diameter cost-constrained Steiner trees

0 references

An improved FPTAS for Restricted Shortest Path.

0 references

Finding Multi-Constrained Multiple Shortest Paths

0 references

0 references

A dual algorithm for the constrained shortest path problem

0 references

Approximation Schemes for the Restricted Shortest Path Problem

0 references

Algorithms for finding paths with multiple constraints

0 references

A simple efficient approximation scheme for the restricted shortest path problem

0 references

Efficient QoS routing.

0 references

Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems

0 references

Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes

0 references

Multiconstrained QoS Routing: A Norm Approach

0 references

A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology

0 references

Identifiers

10.1007/978-3-030-89543-3_40

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2695315

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2695315&oldid=37503656"