[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/jacm/Baker94>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Brenda_S._Baker>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1145%2F174644.174650>
foaf:homepage <https://doi.org/10.1145/174644.174650>
dc:identifier DBLP journals/jacm/Baker94 (xsd:string)
dc:identifier DOI doi.org%2F10.1145%2F174644.174650 (xsd:string)
dcterms:issued 1994 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/jacm>
rdfs:label Approximation Algorithms for NP-Complete Problems on Planar Graphs. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Brenda_S._Baker>
swrc:number 1 (xsd:string)
swrc:pages 153-180 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/jacm/Baker94/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/jacm/Baker94>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/jacm/jacm41.html#Baker94>
rdfs:seeAlso <https://doi.org/10.1145/174644.174650>
dc:subject Hamiltonian circuit, Hamiltonian path, NP-complete, approximation algorithms, approximation schemes, dominating set, independent set, partition into perfect matchings, partition into triangles, planar graphs, vertex cover (xsd:string)
dc:title Approximation Algorithms for NP-Complete Problems on Planar Graphs. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 41 (xsd:string)