"Approximation Schemes for Minimum-Cost k-Connectivity Problems in ..."

Artur Czumaj, Andrzej Lingas (2007)

> Home

Details and statistics

DOI: 10.1201/9781420010749.CH51

access: closed

type: Reference Work

metadata version: 2017-07-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - reference/crc/CzumajL07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/reference/crc/CzumajL07
Artur Czumaj, Andrzej Lingas:
Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. Handbook of Approximation Algorithms and Metaheuristics 2007

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.