Algorithms for the Multi-constrained Routing Problem

DOI10.1007/3-540-45471-3_35zbMATH Open1078.68545OpenAlexW1487595196MaRDI QIDQ3046509FDOQ3046509

Authors: Anuj Puri, Stavros Tripakis 

Publication date: 12 August 2004

Published in: Algorithm Theory — SWAT 2002 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45471-3_35

Recommendations

• The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization
• A quality of service multi-constraints routing algorithm based on dynamic programming
• Fast approximation algorithms for routing problems with hop-wise constraints
• Precomputation for multi-constrained QoS routing in GMPLS networks
• Optimal path algorithm with multi-constrained condition

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Cited In (10)

• The subdivision-constrained routing requests problem
• The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization
• Optimal path algorithm with multi-constrained condition
• Constraint games for stable and optimal allocation of demands in SDN
• An algorithm for the solution of the two-route Johnson problem
• Optimal reachability for multi-priced timed automata
• On an iterative procedure for solving a routing problem with constraints
• Title not available (Why is that?)
• Multi-weighted reachability games
• Multi-weighted automata and MSO logic

This page was built for publication: Algorithms for the Multi-constrained Routing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046509)