A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/medalg/OualiFS12
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/medalg/OualiFS12
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Anand_Srivastav
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Helena_Fohlin
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mourad_El_Ouali
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-642-34862-4%5F13
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-642-34862-4_13
>
dc:
identifier
DBLP conf/medalg/OualiFS12
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-642-34862-4%5F13
(xsd:string)
dcterms:
issued
2012
(xsd:gYear)
rdfs:
label
A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Anand_Srivastav
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Helena_Fohlin
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mourad_El_Ouali
>
swrc:
pages
174-187
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/medalg/2012
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/medalg/OualiFS12/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/medalg/OualiFS12
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/medalg/medalg2012.html#OualiFS12
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-642-34862-4_13
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/medalg
>
dc:
title
A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document