"Minimum Cost Edge Subset Covering Exactly k Vertices of a Graph."

Ján Plesník (2001)

> Home

Details and statistics

DOI: 10.1023/A:1011457225589

access: closed

type: Journal Article

metadata version: 2017-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/Plesnik01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/Plesnik01
Ján Plesník:
Minimum Cost Edge Subset Covering Exactly k Vertices of a Graph. J. Comb. Optim. 5(3): 275-286 (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.