"A Mildly Exponential Time Algorithm for Approximating the Number of ..."

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

Martin E. Dyer et al. (1993)

> Home

Details and statistics

DOI: 10.1017/S0963548300000675

access: closed

type: Journal Article

metadata version: 2020-03-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cpc/DyerFKKPV93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/DyerFKKPV93
Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani:
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. Comb. Probab. Comput. 2: 271-284 (1993)

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.