"An o(log2 k)-approximation algorithm for the k-vertex connected ..."

Jittat Fakcharoenphol, Bundit Laekhanukit (2008)

> Home

Details and statistics

DOI: 10.1145/1374376.1374401

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/FakcharoenpholL08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/FakcharoenpholL08
Jittat Fakcharoenphol, Bundit Laekhanukit:
An o(log² k)-approximation algorithm for the k-vertex connected spanning subgraph problem. STOC 2008: 153-158

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.