Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Polynomial time approximation schemes for dense instances of ..."

Sanjeev Arora, David R. Karger, Marek Karpinski (1995)

> Home

Details and statistics

DOI: 10.1145/225058.225140

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/AroraKK95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/AroraKK95
Sanjeev Arora, David R. Karger, Marek Karpinski:
Polynomial time approximation schemes for dense instances of NP-hard problems. STOC 1995: 284-293

a service of

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.