On Stability of Widest Path in Network Routing
Ahmad Hosseini, Bita Kabir Baiki
Journal of Advances in Mathematics and Computer Science · pp. 1–10 · Published 5 Aug 2017
10.9734/JAMCS/2017/35358Abstract
The problem of widest path (WP) is a well-established topic in network routing and digital compositing. This paper contemplates one facet of the robustness of optimal solutions to the widest path; i.e., stability analysis of the WP problem. The study here deals with infimum and supremum perturbations which determine multiplicative changes each individual arc can tolerate conserving the optimality of a given WP. It is additionally illustrated how to determine these marginal values for all arcs, and an algorithm for computing all such values is proposed.
Cited by 0
No indexed citations yet.
Related research
- Solving Network Routing Problem Using Artificial Intelligent Techniques — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
0
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.