"Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching"

Joseph Cheriyan, Ramakrishna Thurimella (1998)

> Home

Details and statistics

DOI: —

access: unavailable

type: Informal or Other Publication

metadata version: 2022-09-28

- no documents available
- export record
  dblp key:
  - journals/eccc/ECCC-TR98-025
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ECCC-TR98-025
Joseph Cheriyan, Ramakrishna Thurimella:
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching. Electron. Colloquium Comput. Complex. TR98 (1998)

a service of

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.