"Approximation Algorithms for Minimum-Cost $k\hbox{-}(S, T)$ Connected ..."

Joseph Cheriyan, Bundit Laekhanukit (2013)

> Home

Details and statistics

DOI: 10.1137/100818728

access: closed

type: Journal Article

metadata version: 2020-04-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/CheriyanL13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/CheriyanL13
Joseph Cheriyan, Bundit Laekhanukit:
Approximation Algorithms for Minimum-Cost $k\hbox{-}(S, T)$ Connected Digraphs. SIAM J. Discret. Math. 27(3): 1450-1481 (2013)

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.