"The clique problem with multiple-choice constraints under a cycle-free ..."

Andreas Bärmann, Patrick Gemander, Maximilian Merkert (2020)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2019.12.015

access: closed

type: Journal Article

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/BarmannGM20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/BarmannGM20
Andreas Bärmann, Patrick Gemander, Maximilian Merkert:
The clique problem with multiple-choice constraints under a cycle-free dependency graph. Discret. Appl. Math. 283: 59-77 (2020)

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.