On total traffic domination in non-complete graphs
(2011) In Operations Research Letters 39. p.40-43- Abstract
- 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:
https://lup.lub.lu.se/record/1720017
- author
- Pavon-Marino, P. and Pioro, Michal LU
- organization
- publishing date
- 2011
- 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
- 2016-04-01 10:22:50
- date last changed
- 2022-05-17 22:23:28
@article{f60bab0f-f495-416a-925c-f899a602f928, abstract = {{Abstract in Undetermined<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 >= h component-wise. In this paper we give a generalized condition for vertical bar H vertical bar >= 1 and any undirected graph.}}, author = {{Pavon-Marino, P. and Pioro, Michal}}, issn = {{0167-6377}}, keywords = {{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}}, doi = {{10.1016/j.orl.2010.11.007}}, volume = {{39}}, year = {{2011}}, }