Amanote Research
Register
Sign In
Approximation Algorithms for Multiconstrained Quality-Of-Service Routing
IEEE Transactions on Computers
- United States
doi 10.1109/tc.2006.67
Full Text
Open PDF
Abstract
Available in
full text
Categories
Hardware
Architecture
Mathematics
Computational Theory
Theoretical Computer Science
Software
Date
May 1, 2006
Authors
S. Sahni
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Related search
Convergence Results for Ant Routing Algorithms via Stochastic Approximation
ACM Transactions on Autonomous and Adaptive Systems
Control
Systems Engineering
Computer Science
Software
Research on Innovating and Applying Evolutionary Algorithms Based Hierarchical Clustering and Multiple Paths Routing for Guaranteed Quality of Service on Service Based Routing
Internet of Things and Cloud Computing
Evolutionary Computation for Quality of Service Internet Routing Optimization
Two Approximation Algorithms for Probabilistic Coalition Structure Generation With Quality Bound
Autonomous Agents and Multi-Agent Systems
Artificial Intelligence
Centralized and Distributed Approximation Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation
Analysis of Multicast Routing Protocols Using Quality of Service
International Journal of Signal Processing Systems
A Service Priority Differentiated Quality of Service Routing Protocol for MANET: Mobile Ad Hoc Network
Information Technology Journal
Approximation Algorithms for Intersection Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Approximation Algorithms for Geometric Networks
