"Finding approximate solutions to combinatorial problems with very large ..."

Justin Harrington, Matías Salibián Barrera (2010)

> Home

Details and statistics

DOI: 10.1016/J.CSDA.2008.08.001

access: closed

type: Journal Article

metadata version: 2020-09-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/csda/HarringtonS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/csda/HarringtonS10
Justin Harrington, Matías Salibián Barrera:
Finding approximate solutions to combinatorial problems with very large data sets using BIRCH. Comput. Stat. Data Anal. 54(3): 655-667 (2010)

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.