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

Artur Czumaj, Andrzej Lingas (2018)

> Home

Details and statistics

DOI: —

access: unavailable

type: Part in Book or Collection

metadata version: 2019-10-25

- no documents available
- export record
  dblp key:
  - books/tf/18/CzumajL18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/tf/18/CzumajL18
Artur Czumaj, Andrzej Lingas:
Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. Handbook of Approximation Algorithms and Metaheuristics (2) 2018

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.