Advanced

On total traffic domination in non-complete graphs

Pavon-Marino, P. and Pioro, Michal LU (2011) In Operations Research Letters 39. p.40-43
Abstract (Swedish)
Abstract in Undetermined

Given an undirected graph g(V, E), a set of traffic matrices H and one additional traffic matrix h, we say that H totally dominates h if, for each capacity reservation u supporting H, u also supports h using the same routing pattern. It has been shown that if vertical bar H vertical bar = 1 = (H = {(h) over cap}, say) and g, is a complete graph, H totally dominates h if, and only if, (h) over cap >= h component-wise. In this paper we give a generalized condition for vertical bar H vertical bar >= 1 and any undirected graph.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
Network optimization, Traffic matrices domination, Multi-hour optimization
in
Operations Research Letters
volume
39
pages
40 - 43
publisher
Elsevier
external identifiers
  • wos:000287348600009
  • scopus:78650783405
ISSN
0167-6377
DOI
10.1016/j.orl.2010.11.007
language
English
LU publication?
yes
id
f60bab0f-f495-416a-925c-f899a602f928 (old id 1720017)
date added to LUP
2010-11-22 10:41:39
date last changed
2017-01-01 03:32:01
@article{f60bab0f-f495-416a-925c-f899a602f928,
  abstract     = {<b>Abstract in Undetermined</b><br/><br>
Given an undirected graph g(V, E), a set of traffic matrices H and one additional traffic matrix h, we say that H totally dominates h if, for each capacity reservation u supporting H, u also supports h using the same routing pattern. It has been shown that if vertical bar H vertical bar = 1 = (H = {(h) over cap}, say) and g, is a complete graph, H totally dominates h if, and only if, (h) over cap &gt;= h component-wise. In this paper we give a generalized condition for vertical bar H vertical bar &gt;= 1 and any undirected graph.},
  author       = {Pavon-Marino, P. and Pioro, Michal},
  issn         = {0167-6377},
  keyword      = {Network optimization,Traffic matrices domination,Multi-hour optimization},
  language     = {eng},
  pages        = {40--43},
  publisher    = {Elsevier},
  series       = {Operations Research Letters},
  title        = {On total traffic domination in non-complete graphs},
  url          = {http://dx.doi.org/10.1016/j.orl.2010.11.007},
  volume       = {39},
  year         = {2011},
}