"An O (mn log U ) time algorithm for estimating the maximum cost of ..."

Mehdi Ghiyasvand (2016)

> Home

Details and statistics

DOI: 10.1007/S11235-016-0151-9

access: closed

type: Journal Article

metadata version: 2020-08-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/telsys/Ghiyasvand16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/telsys/Ghiyasvand16
Mehdi Ghiyasvand:
An O (mn log U ) time algorithm for estimating the maximum cost of adjusting an infeasible network. Telecommun. Syst. 63(4): 719-725 (2016)

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.