On the minimum-cost $$\lambda $$ λ -edge-connected k-subgraph problem
Crossref DOI link: https://doi.org/10.1007/s10287-016-0260-7
Published Online: 2016-06-21
Published Print: 2016-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Sadeghi, Elham
Fan, Neng
License valid from 2016-06-21
