"Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in ..."

Glencora Borradaile, Erik D. Demaine, Siamak Tazari (2009)

> Home

Details and statistics

DOI: 10.4230/LIPICS.STACS.2009.1835

access: open

type: Conference or Workshop Paper

metadata version: 2018-08-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/stacs/BorradaileDT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/BorradaileDT09
Glencora Borradaile, Erik D. Demaine, Siamak Tazari:
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. STACS 2009: 171-182

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.