default search action

combined dblp search
author search
venue search
publication search

ask others

"Optimal Bound on the Combinatorial Complexity of Approximating Polytopes."

Rahul Arya et al. (2022)

> Home

Details and statistics

DOI: 10.1145/3559106

access: closed

type: Journal Article

metadata version: 2022-12-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/AryaAFM22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/AryaAFM22
Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. ACM Trans. Algorithms 18(4): 35:1-35:29 (2022)

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.