On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/ifipTCS/MishraS00
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/ifipTCS/MishraS00
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Kripasindhu_Sikdar
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sounaka_Mishra
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F3-540-44929-9%5F15
>
foaf:
homepage
<
https://doi.org/10.1007/3-540-44929-9_15
>
dc:
identifier
DBLP conf/ifipTCS/MishraS00
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F3-540-44929-9%5F15
(xsd:string)
dcterms:
issued
2000
(xsd:gYear)
rdfs:
label
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Kripasindhu_Sikdar
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sounaka_Mishra
>
swrc:
pages
186-199
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/ifipTCS/2000
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/ifipTCS/MishraS00/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/ifipTCS/MishraS00
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/ifipTCS/ifipTCS2000.html#MishraS00
>
rdfs:
seeAlso
<
https://doi.org/10.1007/3-540-44929-9_15
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/ifipTCS
>
dc:
subject
NP-optimization problems, Minimaximal and maximinimal NP-optimization problems, Approximation algorithms, Hardness of approximation, APX-hardness, L-reduction.
(xsd:string)
dc:
title
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document