"An efficient algorithm for minimumk-covers in weighted graphs."

Lee J. White, Mark Lee Gillenson (1975)

> Home

Details and statistics

DOI: 10.1007/BF01580426

access: closed

type: Journal Article

metadata version: 2020-04-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/WhiteG75
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/WhiteG75
Lee J. White, Mark Lee Gillenson:
An efficient algorithm for minimumk-covers in weighted graphs. Math. Program. 8(1): 20-42 (1975)

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.