On Approximation Hardness of the Minimum 2SAT-DELETION Problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/mfcs/ChlebikC04
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/mfcs/ChlebikC04
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Janka_Chleb%E2%88%9A%E2%89%A0kov%E2%88%9A%C2%B0
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Miroslav_Chleb%E2%88%9A%E2%89%A0k
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-28629-5%5F18
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-540-28629-5_18
>
dc:
identifier
DBLP conf/mfcs/ChlebikC04
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-540-28629-5%5F18
(xsd:string)
dcterms:
issued
2004
(xsd:gYear)
rdfs:
label
On Approximation Hardness of the Minimum 2SAT-DELETION Problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Janka_Chleb%E2%88%9A%E2%89%A0kov%E2%88%9A%C2%B0
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Miroslav_Chleb%E2%88%9A%E2%89%A0k
>
swrc:
pages
263-273
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/mfcs/2004
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/mfcs/ChlebikC04/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/mfcs/ChlebikC04
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/mfcs/mfcs2004.html#ChlebikC04
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-540-28629-5_18
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/mfcs
>
dc:
title
On Approximation Hardness of the Minimum 2SAT-DELETION Problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document