Glencora Borradaile

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

◀ ▶ joint publications with Brent Heeringa

> Home > Persons > Glencora Borradaile

Publications

2012
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jda/BorradaileHW12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/BorradaileHW12
Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong:
The knapsack problem with neighbour constraints. J. Discrete Algorithms 16: 224-235 (2012)
[c13]
- view
  - electronic edition @ icml.cc (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/icml/AzimiFFBH12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/AzimiFFBH12
Javad Azimi, Alan Fern, Xiaoli Zhang Fern, Glencora Borradaile, Brent Heeringa:
Batch Active Learning via Coordinated Matching. ICML 2012
2011
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/iwoca/BorradaileHW11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwoca/BorradaileHW11
Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong:
The 1-Neighbour Knapsack Problem. IWOCA 2011: 71-84
2009
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-0910-0777
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0910-0777
Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong:
Approximation Algorithms for Constrained Knapsack Problems. CoRR abs/0910.0777 (2009)

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.