A deterministic annealing algorithm for approximating a solution of the max-bisection problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/nn/DangHH02
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/nn/DangHH02
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Chuangyin_Dang
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ip_Kee_Hui
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Liping_He
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2FS0893-6080%2802%2900027-8
>
foaf:
homepage
<
https://doi.org/10.1016/S0893-6080(02)00027-8
>
dc:
identifier
DBLP journals/nn/DangHH02
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2FS0893-6080%2802%2900027-8
(xsd:string)
dcterms:
issued
2002
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/nn
>
rdfs:
label
A deterministic annealing algorithm for approximating a solution of the max-bisection problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Chuangyin_Dang
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ip_Kee_Hui
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Liping_He
>
swrc:
number
3
(xsd:string)
swrc:
pages
441-458
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/nn/DangHH02/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/nn/DangHH02
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/nn/nn15.html#DangHH02
>
rdfs:
seeAlso
<
https://doi.org/10.1016/S0893-6080(02)00027-8
>
dc:
title
A deterministic annealing algorithm for approximating a solution of the max-bisection problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
15
(xsd:string)