"Greedy-type resistance of combinatorial problems."

Gareth Bendall, François Margot (2006)

> Home

Details and statistics

DOI: 10.1016/J.DISOPT.2006.03.001

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/disopt/BendallM06a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/disopt/BendallM06a
Gareth Bendall, François Margot:
Greedy-type resistance of combinatorial problems. Discret. Optim. 3(4): 288-298 (2006)

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.