Journal article
Uniform multicommodity flows in the hypercube with random edge‐capacities
- Abstract:
- We give two results for multicommodity flows in thed-dimensional hypercubeQdwithindependent random edge-capacities distributed like a random variableCwhereP[C>0]>1/2.Firstly, with high probability asd→∞, the network can support simultaneous multicommodityflows of volume close toE[C]between all antipodal vertex pairs. Secondly, with high probability,the network can support simultaneous multicommodity flows of volume close to 21−dE[C]betweenall vertex pairs. Both results are best possible.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
- Version:
- Accepted Manuscript
Actions
Access Document
- Files:
-
-
(pdf, 444.0KB)
-
- Publisher copy:
- 10.1002/rsa.20672
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Publisher:
- Wiley Publisher's website
- Journal:
- Random Structures and Algorithms Journal website
- Volume:
- 50
- Issue:
- 3
- Pages:
- 437–463
- Publication date:
- 2016-11-07
- Acceptance date:
- 2016-01-20
- DOI:
- ISSN:
-
1098-2418
- URN:
-
uuid:ba3605f3-cbea-42b6-a097-9426d521de31
- Source identifiers:
-
499852
- Local pid:
- pubs:499852
- Paper number:
- 3
Item Description
- Keywords:
Terms of use
- Copyright holder:
- Wiley Periodicals, Inc.
- Copyright date:
- 2016
- Notes:
-
Copyright © 2016 Wiley Periodicals, Inc. This is the accepted manuscript version of the article. The final version is available online from Wiley at: https://doi.org/10.1002/rsa.20672
If you are the owner of this record, you can report an update to it here: Report update to this record