"Approximation algorithms for combinatorial optimization problems in graph ..."

Piotr Krysta (2001)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2023-03-22

- view
  authority control:
- export record
  dblp key:
  - phd/de/Krysta01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/de/Krysta01
Piotr Krysta:
Approximation algorithms for combinatorial optimization problems in graph coloring and network desig. Saarland University, Germany, 2001

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.