Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On the Hardness of Approximating Some NP-optimization Problems Related to ..."

Sounaka Mishra, Kripasindhu Sikdar (2001)

> Home

Details and statistics

DOI: 10.1051/ITA:2001121

access: closed

type: Journal Article

metadata version: 2020-05-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ita/MishraS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/MishraS01
Sounaka Mishra, Kripasindhu Sikdar:
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem. RAIRO Theor. Informatics Appl. 35(3): 287-309 (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.