[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FakcharoenpholL08>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Bundit_Laekhanukit>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Jittat_Fakcharoenphol>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1145%2F1374376.1374401>
foaf:homepage <https://doi.org/10.1145/1374376.1374401>
dc:identifier DBLP conf/stoc/FakcharoenpholL08 (xsd:string)
dc:identifier DOI doi.org%2F10.1145%2F1374376.1374401 (xsd:string)
dcterms:issued 2008 (xsd:gYear)
rdfs:label An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Bundit_Laekhanukit>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Jittat_Fakcharoenphol>
swrc:pages 153-158 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/stoc/2008>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/stoc/FakcharoenpholL08/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/stoc/FakcharoenpholL08>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/stoc/stoc2008.html#FakcharoenpholL08>
rdfs:seeAlso <https://doi.org/10.1145/1374376.1374401>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/stoc>
dc:subject approximation algorithms for NP-hard problems, k-connected spanning subgraphs, network design (xsd:string)
dc:title An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document