"A randomized rounding approach to a k-splittable multicommodity flow ..."

Pawel Bialon (2017)

> Home

Details and statistics

DOI: 10.1007/S11235-016-0190-2

access: open

type: Journal Article

metadata version: 2020-08-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/telsys/Bialon17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/telsys/Bialon17
Pawel Bialon:
A randomized rounding approach to a k-splittable multicommodity flow problem with lower path flow bounds affording solution quality guarantees. Telecommun. Syst. 64(3): 525-542 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.