"On the minimum-cost λ-edge-connected k-subgraph problem."

Elham Sadeghi, Neng Fan (2016)

> Home

Details and statistics

DOI: 10.1007/S10287-016-0260-7

access: closed

type: Journal Article

metadata version: 2020-05-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cms/SadeghiF16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cms/SadeghiF16
Elham Sadeghi, Neng Fan:
On the minimum-cost λ-edge-connected k-subgraph problem. Comput. Manag. Sci. 13(4): 571-596 (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.