"Note on the computational complexity of least core concepts for min-cost ..."

Ulrich Faigle, Walter Kern, Daniël Paulusma (2000)

> Home

Details and statistics

DOI: 10.1007/S001860000059

access: closed

type: Journal Article

metadata version: 2020-09-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mmor/FaigleKP00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mmor/FaigleKP00
Ulrich Faigle, Walter Kern, Daniël Paulusma:
Note on the computational complexity of least core concepts for min-cost spanning tree games. Math. Methods Oper. Res. 52(1): 23-38 (2000)

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.