On the public citation graph
Approximation algorithms for multiconstrained quality-of-service routing
0 signed · 39 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230140109openalex-snapshot
Algorithms for finding paths with multiple constraints
inferredcites →https://doi.org/10.1016/s0140-3664(01)00358-9openalex-snapshot
An efficient algorithm for finding a path subject to two additive constraints
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.1109/65.752646openalex-snapshot
An overview of quality of service routing for next-generation high-speed networks: problems and solutions
inferredcites →https://doi.org/10.1109/90.993305openalex-snapshot
Heuristic algorithms for multiconstrained quality-of-service routing
inferredcites →https://doi.org/10.1109/comst.2003.5342226openalex-snapshot
Constraint-based routing in the internet: Basic principles and recent research
inferredcites →https://doi.org/10.1109/glocom.2004.1378205openalex-snapshot
Two techniques for fast computation of constrained shortest paths
inferredcites →https://doi.org/10.1109/icc.1998.685137openalex-snapshot
On finding multi-constrained paths
inferredcites →https://doi.org/10.1109/infcom.2001.916274openalex-snapshot
Multi-constrained optimal path selection
inferredcites →https://doi.org/10.1109/infcom.2001.916276openalex-snapshot
Efficient computation of delay-sensitive routes from one source to all destinations
inferredcites →https://doi.org/10.1109/mcom.2002.1106159openalex-snapshot
An overview of constraint-based path selection algorithms for QoS routing
inferredcites →https://doi.org/10.1145/316188.316229openalex-snapshot
On power-law relationships of the Internet topology
inferredcites →https://doi.org/10.1145/316194.316229openalex-snapshot
On power-law relationships of the Internet topology
inferredcites →https://doi.org/10.1145/321812.321823openalex-snapshot
Computing Partitions with Applications to the Knapsack Problem
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.25.6.920openalex-snapshot
General Techniques for Combinatorial Approximation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470611470.ch4openalex-snapshot
Quality of Service‐based Adaptive Routing Approaches
inferred← citeshttps://doi.org/10.1007/978-1-4614-0278-7_7openalex-snapshot
Temperature- and Energy-Constrained Scheduling
inferred← citeshttps://doi.org/10.1007/s11590-017-1212-zopenalex-snapshot
Multi-criteria approximation schemes for the resource constrained shortest path problem
inferred← citeshttps://doi.org/10.1007/s12243-008-0064-zopenalex-snapshot
Quality of service models for heterogeneous networks: overview and challenges
inferred← citeshttps://doi.org/10.1016/j.comcom.2009.05.002openalex-snapshot
Design and performance analysis of an inductive QoS routing algorithm
inferred← citeshttps://doi.org/10.1016/j.comnet.2010.05.017openalex-snapshot
A survey on multi-constrained optimal path computation: Exact and approximate algorithms
inferred← citeshttps://doi.org/10.1016/j.comnet.2022.109015openalex-snapshot
Deploying near-optimal delay-constrained paths with Segment Routing in massive-scale networks
inferred← citeshttps://doi.org/10.1016/j.jnca.2011.09.009openalex-snapshot
Routing with multiple quality-of-services constraints: An approximation perspective
inferred← citeshttps://doi.org/10.1109/aina.2009.24openalex-snapshot
An Approach to Find Maximal Disjoint Paths with Reliability and Delay Constraints
inferred← citeshttps://doi.org/10.1109/ccdc.2009.5192909openalex-snapshot
A distributed parallel QoS routing algorithm with multi-path probing
inferred← citeshttps://doi.org/10.1109/hpcs.2007.32openalex-snapshot
Towards a Decentralized Algorithm for Mapping Network and Computational Resources for Distributed Data-Flow Computations
inferred← citeshttps://doi.org/10.1109/icc.2008.353openalex-snapshot
Average-Bandwidth Delay Q-Routing Adaptive Algorithm
inferred← citeshttps://doi.org/10.1109/icnp.2008.4697051openalex-snapshot
An approximation algorithm for QoS routing with two additive constraints
inferred← citeshttps://doi.org/10.1109/iscc.2008.4625670openalex-snapshot
Distributed Quality-of-Service routing of best constrained shortest paths.
inferred← citeshttps://doi.org/10.1109/jsac.2018.2804045openalex-snapshot
Multi-Resource Coordinate Scheduling for Earth Observation in Space Information Networks
inferred← citeshttps://doi.org/10.1109/scc.2015.53openalex-snapshot
Workflow-Based Service Selection under Multi-constraints
inferred← citeshttps://doi.org/10.1109/softcom.2008.4669468openalex-snapshot
Design and performance analysis of inductive QoS scheduling for dynamic network routing
inferred← citeshttps://doi.org/10.1109/tc.2007.1016openalex-snapshot
Multiconstrained QoS Routing: A Norm Approach
inferred← citeshttps://doi.org/10.1145/1384117.1384132openalex-snapshot
Design and implementation of a scalable constraint-based routing module for QoS path computation
inferred← citeshttps://doi.org/10.15476/elte.2019.241openalex-snapshot
Integer programming approaches for solving routing and scheduling problems
inferred← citeshttps://doi.org/10.5772/5289openalex-snapshot
Inductive Approaches Based on Trial/Error Paradigm for Communications Network
inferred← citeshttps://doi.org/10.82308/45669openalex-snapshot
Managing opportunistic and dedicated resources in a bi-modal service deployment architecture
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.