Fast approximation algorithms for routing problems with hop-wise constraints

Keyphrases

• Routing Problem 100%
• Fast Approximation Algorithms 100%
• Multi-constrained Routing 75%
• Approximation Scheme 50%
• Polynomial Approximation 50%
• NP-hard 25%
• Node number 25%
• Minimum Cost 25%
• Destination Node 25%
• Algorithm Complexity 25%
• Maximum Benefit 25%
• End-to-end Delay Bound 25%
• Type Constraints 25%
• Interval Partition 25%
• Single Constraint 25%

Computer Science

• Approximation Algorithms 100%
• Routing Problem 100%
• approximation scheme 50%
• Polynomial Approximation 50%
• End-to-end Delay Constraint 25%
• Type Constraint 25%
• Destination Node 25%