"A Modified Greedy Heuristic for the Set Covering Problem with Improved ..."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Olivier Goldschmidt, Dorit S. Hochbaum, Gang Yu (1993)

> Home

Details and statistics

DOI: 10.1016/0020-0190(93)90173-7

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/GoldschmidtHY93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/GoldschmidtHY93
Olivier Goldschmidt, Dorit S. Hochbaum, Gang Yu:
A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound. Inf. Process. Lett. 48(6): 305-310 (1993)

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.