[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/wg/EscoffierGM07>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Bruno_Escoffier>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/J%E2%88%9A%C2%A9r%E2%88%9A%C4%ABme_Monnot>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Laurent_Gourv%E2%88%9A%C2%AEs>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-74839-7%5F20>
foaf:homepage <https://doi.org/10.1007/978-3-540-74839-7_20>
dc:identifier DBLP conf/wg/EscoffierGM07 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F978-3-540-74839-7%5F20 (xsd:string)
dcterms:issued 2007 (xsd:gYear)
rdfs:label Complexity and Approximation Results for the Connected Vertex Cover Problem. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Bruno_Escoffier>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/J%E2%88%9A%C2%A9r%E2%88%9A%C4%ABme_Monnot>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Laurent_Gourv%E2%88%9A%C2%AEs>
swrc:pages 202-213 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/wg/2007>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/wg/EscoffierGM07/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/wg/EscoffierGM07>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/wg/wg2007.html#EscoffierGM07>
rdfs:seeAlso <https://doi.org/10.1007/978-3-540-74839-7_20>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/wg>
dc:subject Connected vertex cover; chordal graphs; bipartite graphs; planar graphs; APX-complete; approximation algorithm (xsd:string)
dc:title Complexity and Approximation Results for the Connected Vertex Cover Problem. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document