"Nearly linear time approximations for mixed packing and covering problems ..."

Kent Quanrud (2020)

> Home

Details and statistics

DOI: 10.1137/1.9781611976014.11

access: closed

type: Conference or Workshop Paper

metadata version: 2021-03-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/soda/Quanrud20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/Quanrud20
Kent Quanrud:
Nearly linear time approximations for mixed packing and covering problems without data structures or randomization. SOSA 2020: 69-80

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.