Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard ..."

Marek Karpinski (2001)

> Home

Details and statistics

DOI: 10.1007/S00453-001-0012-Z

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/Karpinski01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/Karpinski01
Marek Karpinski:
Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems. Algorithmica 30(3): 386-397 (2001)

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.