[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/tc/ZissimopoulosPP91>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Ferhan_Pekergin>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Vangelis_Th._Paschos>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Vassilis_Zissimopoulos>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2F12.106226>
foaf:homepage <https://doi.org/10.1109/12.106226>
dc:identifier DBLP journals/tc/ZissimopoulosPP91 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2F12.106226 (xsd:string)
dcterms:issued 1991 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/tc>
rdfs:label On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Ferhan_Pekergin>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Vangelis_Th._Paschos>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Vassilis_Zissimopoulos>
swrc:number 12 (xsd:string)
swrc:pages 1413-1418 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/tc/ZissimopoulosPP91/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/tc/ZissimopoulosPP91>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/tc/tc40.html#ZissimopoulosPP91>
rdfs:seeAlso <https://doi.org/10.1109/12.106226>
dc:subject approximation; NP-complete problems; Boltzmann machine method; covering; packing problems; maximum independent set; set partitioning; clique; minimum vertex cover; minimum set cover; optimal solutions; combinatorial mathematics; computational complexity; heuristic programming; neural nets; parallel architectures. (xsd:string)
dc:title On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 40 (xsd:string)