"Exact and approximation algorithms for some packing and covering problems ..."

Cédric Bentz (2017)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2021-02-23

- view
  - electronic edition @ archives-ouvertes.fr
- export record
  dblp key:
  - books/hal/Bentz17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/hal/Bentz17
Cédric Bentz:
Exact and approximation algorithms for some packing and covering problems in graphs. Sorbonne University, France, 2017

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.