On Stability of Widest Path in Network Routing
Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 23, Issue 6
Abstract
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.
Authors and Affiliations
Ahmad Hosseini, Bita Kabir Baiki
Keywords
Related Articles
- EP ID EP322269
- DOI 10.9734/JAMCS/2017/35358
- Views 91
- Downloads 0
A Stochastic Model of the Dynamics of Stock Price for Forecasting
In this work, a stochastic model of some selected stocks in the Nigerian Stock Exchange (NSE) is formulated. We considered four different stocks and their market prices. The likelihood of each change occurring in the sto...
Geometric Aspects of Denseness Theorems for Dirichlet Functions
The first theorem related to the denseness of the image of a vertical line Re s = σ0, σ0 > 1 by the Riemann Zeta function has been proved by Harald Bohr in 1911. We argue that this theorem is not really a denseness theor...
On Convexity of Right-Closed Integral Sets
Let N denote the set of non-negative integers. A set of non-negative, n-dimensional integral vectors, M⊂ Nn, is said to be right-closed, if ((x ∈M) ∧ (y ≥ x) ∧ (y ∈ Nn)) ⇒ (y ∈M). In this paper, we present a polynomial t...
Rigidity and Shrinkability of Diagonalizable Matrices
We introduce the seemingly new concept of a rigid matrix based on the comparison of its sparsity to the sparsity of the natural powers of the matrix. Our results could be useful as a usage guide in the scheduling of vari...
Conflict Resolution for Sacramento-San-Joaquin Delta with Stability and Sensitivity Analyses Using the Graph Model
The goal of this paper is to resolve the strategic long-term dispute for the Sacramento-San Joaquin Delta California using the Graph Model approach for conflict resolution. To facilitate the analysis, a Decision Support...