On the public citation graph

Fully Polynomial Time Approximation Schemes for Finding Cheapest Deadline Paths

0 signed · 24 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230100403openalex-snapshot
A dual algorithm for the constrained shortest path problem
inferredcites →https://doi.org/10.1002/net.3230140109openalex-snapshot
Algorithms for finding paths with multiple constraints
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/s00453-004-1119-9openalex-snapshot
A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology
inferredcites →https://doi.org/10.1007/s10878-013-9611-2openalex-snapshot
Minimum diameter cost-constrained Steiner trees
inferredcites →https://doi.org/10.1016/s0020-0190(02)00205-3openalex-snapshot
An improved FPTAS for Restricted Shortest Path
inferredcites →https://doi.org/10.1016/s0167-6377(01)00069-4openalex-snapshot
A simple efficient approximation scheme for the restricted shortest path problem
inferredcites →https://doi.org/10.1016/s1389-1286(00)00209-7openalex-snapshot
A randomized algorithm for finding a path subject to multiple QoS requirements
inferredcites →https://doi.org/10.1016/s1389-1286(03)00286-xopenalex-snapshot
Efficient QoS routing
inferredcites →https://doi.org/10.1109/49.536364openalex-snapshot
Quality-of-service routing for supporting multimedia applications
inferredcites →https://doi.org/10.1109/90.993305openalex-snapshot
Heuristic algorithms for multiconstrained quality-of-service routing
inferredcites →https://doi.org/10.1109/infcom.1999.751454openalex-snapshot
Implementation and performance measurements of QoS routing extensions to OSPF
inferredcites →https://doi.org/10.1109/tc.2006.109openalex-snapshot
QoS routing in communication networks: approximation algorithms based on the primal simplex method of linear programming
inferredcites →https://doi.org/10.1109/tc.2007.1016openalex-snapshot
Multiconstrained QoS Routing: A Norm Approach
inferredcites →https://doi.org/10.1109/tc.2011.61openalex-snapshot
Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes
inferredcites →https://doi.org/10.1109/tc.2014.2366762openalex-snapshot
Finding Multi-Constrained Multiple Shortest Paths
inferredcites →https://doi.org/10.1109/tcomm.2003.811420openalex-snapshot
Minimum-cost QoS multicast and unicast routing in communication networks
inferredcites →https://doi.org/10.1109/tmc.2012.158openalex-snapshot
MAP: Multiconstrained Anypath Routing in Wireless Mesh Networks
inferredcites →https://doi.org/10.1109/tnet.2003.815299openalex-snapshot
Precomputation schemes for QoS routing
inferredcites →https://doi.org/10.1109/tnet.2004.836112openalex-snapshot
Concepts of Exact QoS Routing Algorithms
inferredcites →https://doi.org/10.1109/tnet.2006.890089openalex-snapshot
Finding a Path Subject to Many Additive QoS Constraints
inferredcites →https://doi.org/10.1109/tnet.2007.900712openalex-snapshot
Polynomial Time Approximation Algorithms for Multi-Constrained QoS Routing
inferredcites →https://doi.org/10.1287/moor.17.1.36openalex-snapshot
Approximation Schemes for the Restricted Shortest Path Problem
inferredcites →https://doi.org/10.1287/opre.35.1.70openalex-snapshot
Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.